106 search results - page 16 / 22 » Manhattan-Geodesic Embedding of Planar Graphs |
162
Voted
SIAMDM
2010
14 years 10 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...
157
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
142
Voted
GD
1998
Springer
15 years 8 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
168
Voted
KIVS
2011
Springer
14 years 6 months ago
2011
Springer
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
158
Voted
COCOON
1999
Springer
15 years 8 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...