Sciweavers

704 search results - page 43 / 141
» Isometrically Embedded Graphs
Sort
View
COLOGNETWENTE
2009
15 years 3 months ago
On Self-Duality of Branchwidth in Graphs of Bounded Genus
A graph parameter is self-dual in some class of graphs embeddable in some surface if its value does not change in the dual graph more than a constant factor. Self-duality has been...
Ignasi Sau, Dimitrios M. Thilikos
IPL
2010
111views more  IPL 2010»
15 years 23 days ago
Connecting face hitting sets in planar graphs
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...
Pascal Schweitzer, Patrick Schweitzer
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
16 years 3 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
JGAA
2006
108views more  JGAA 2006»
15 years 2 months ago
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
Sergio Cabello
113
Voted
COCOON
2007
Springer
15 years 8 months ago
Colored Simultaneous Geometric Embeddings
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...
Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabr...