Sciweavers

785 search results - page 29 / 157
» Embedding a Forest in a Graph
Sort
View
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 6 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
COMBINATORICA
2010
13 years 5 months ago
A randomized embedding algorithm for trees
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
Benny Sudakov, Jan Vondrák
JCT
2007
98views more  JCT 2007»
13 years 7 months ago
Triangular embeddings of complete graphs from graceful labellings of paths
We show that to each graceful labelling of a path on 2s + 1 vertices, s ≥ 2, there corresponds a current assignment on a 3-valent graph which generates at least 22s cyclic orien...
Luis A. Goddyn, R. Bruce Richter, Jozef Sirá...
ICPR
2010
IEEE
13 years 9 months ago
Lipreading: A Graph Embedding Approach
In this paper, we propose a novel graph embedding method for the problem of lipreading. To characterize the temporal connections among video frames of the same utterance, a new di...
Ziheng Zhou, Guoying Zhao, Matti Pietikäinen
COMPGEOM
2007
ACM
13 years 11 months ago
Embedding 3-polytopes on a small grid
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
Ares Ribó Mor, Günter Rote, Andr&eacut...