684 search results - page 50 / 137 » On embedding well-separable graphs |
154
click to vote
WAW
2007
Springer
16 years 23 days ago
2007
Springer
We present a new stochastic model for complex networks, based on a spatial embedding of the nodes, called the Spatial Preferred Attachment (SPA) model. In the SPA model, nodes have...
164
click to vote
GD
2008
Springer
15 years 7 months ago
2008
Springer
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
184
click to vote
ICDM
2008
IEEE
16 years 1 months ago
2008
IEEE
Most research on Internet topology is based on active measurement methods. A major difficulty in using these tools is that one comes across many unresponsive routers. Different m...
175
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
213
click to vote
SIAMDM
2010
15 years 1 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...