328 search results - page 26 / 66 » Algorithms for the edge-width of an embedded graph |
150
click to vote
COMPGEOM
2008
ACM
15 years 3 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
100
click to vote
JGT
2007
15 years 1 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
155
click to vote
INFOCOM
2011
IEEE
14 years 5 months ago
2011
IEEE
—In this paper we address the problem of scalable and load balanced routing for wireless sensor networks. Motivated by the analog of the continuous setting that geodesic routing ...
143
click to vote
SDM
2004
SIAM
15 years 2 months ago
2004
SIAM
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
ICCAD
2001
IEEE
15 years 10 months ago
2001
IEEE
In this work, we present an algorithm for simultaneous template generation and matching. The algorithm profiles the graph and iteratively contracts edges to create the templates. ...