785 search results - page 48 / 157 » Embedding a Forest in a Graph |
159
Voted
DCG
2011
14 years 11 months ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
128
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
137
Voted
ICPR
2010
IEEE
15 years 1 months ago
2010
IEEE
We propose a framework to learn scene semantics from surveillance videos. Using the learnt scene semantics, a video analyst can efficiently and effectively retrieve the hidden sem...
123
click to vote
GC
2006
Springer
15 years 4 months ago
2006
Springer
A map is a connected topological graph cellularly embedded in a surface. For a given graph , its genus distribution of rooted maps and embeddings on orientable and non-orientable s...
141
click to vote
IPL
2006
15 years 3 months ago
2006
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...