684 search results - page 50 / 137 » On embedding well-separable graphs |
122
click to vote
WAW
2007
Springer
15 years 10 months 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...
135
click to vote
GD
2008
Springer
15 years 5 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...
151
click to vote
ICDM
2008
IEEE
15 years 11 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...
136
click to vote
COMPGEOM
2009
ACM
15 years 11 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...
166
click to vote
SIAMDM
2010
14 years 11 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...