684 search results - page 1 / 137 » On embedding well-separable graphs |
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
—Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings a...
VLDB
2012
ACM
12 years 9 days ago
2012
ACM
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
ICDAR
2011
IEEE
12 years 4 months ago
2011
IEEE
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...
Presentation
Geometry of Graphs. Talk on celebrated LLR Paper, (November 2006)
CORR
2012
Springer
12 years 15 days ago
2012
Springer
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...