Sciweavers

785 search results - page 48 / 157
» Embedding a Forest in a Graph
Sort
View
DCG
2011
13 years 4 months ago
Small Grid Embeddings of 3-Polytopes
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...
Ares Ribó Mor, Günter Rote, Andr&eacut...
APPROX
2010
Springer
189views Algorithms» more  APPROX 2010»
13 years 9 months ago
Approximating Sparsest Cut in Graphs of Bounded Treewidth
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...
Eden Chlamtac, Robert Krauthgamer, Prasad Raghaven...
ICPR
2010
IEEE
13 years 7 months ago
Learning Scene Semantics Using Fiedler Embedding
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...
Jingen Liu, Saad Ali
GC
2006
Springer
13 years 9 months ago
The Semi-Arc Automorphism Group of a Graph with Application to Map Enumeration
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...
Linfan Mao, Yanpei Liu, Erling Wei
IPL
2006
115views more  IPL 2006»
13 years 9 months ago
Approximate maximum weight branchings
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...
Amitabha Bagchi, Ankur Bhargava, Torsten Suel