704 search results - page 49 / 141 » Isometrically Embedded Graphs |
SIAMCOMP
2008
13 years 9 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
LCTRTS
2007
Springer
14 years 3 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
CHI
2006
ACM
14 years 10 months ago
2006
ACM
As graph models are applied to more widely varying fields, researchers struggle with tools for exploring and analyzing these structures. We describe GUESS, a novel system for grap...
SIAMCOMP
1998
13 years 9 months ago
1998
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...