Sciweavers

704 search results - page 54 / 141
» Isometrically Embedded Graphs
Sort
View
WAW
2007
Springer
85views Algorithms» more  WAW 2007»
14 years 3 months ago
A Spatial Web Graph Model with Local Influence Regions
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...
William Aiello, Anthony Bonato, C. Cooper, Jeannet...
GD
2008
Springer
13 years 10 months ago
Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights
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...
Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu
ICDM
2008
IEEE
121views Data Mining» more  ICDM 2008»
14 years 4 months ago
Unifying Unknown Nodes in the Internet Graph Using Semisupervised Spectral Clustering
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...
Anat Almog, Jacob Goldberger, Yuval Shavitt
COMPGEOM
2009
ACM
14 years 4 months ago
Minimum cuts and shortest homologous cycles
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...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
GD
2007
Springer
14 years 3 months ago
Line Crossing Minimization on Metro Maps
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...