1633 search results - page 97 / 327 » Planar Map Graphs |
HCI
2009
13 years 8 months ago
2009
Circular anchored maps have been proposed as a drawing technique to acquire knowledge from bipartite graphs, where nodes in one set are arranged on a circumference. However, the re...
IPL
2007
13 years 10 months ago
2007
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize th...
SODA
2012
ACM
12 years 21 days ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
ISBI
2004
IEEE
14 years 11 months ago
2004
IEEE
Although flattening a cortical surface necessarily introduces metric distortion due to the non-constant Gaussian curvature of the surface, the Riemann Mapping Theorem states that ...