Sciweavers

2125 search results - page 150 / 425
» On Graph Complexity
Sort
View
FSTTCS
2009
Springer
15 years 4 months ago
Subexponential Algorithms for Partial Cover Problems
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
APPML
2007
101views more  APPML 2007»
14 years 10 months ago
Extension of a theorem of Whitney
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
Paul C. Kainen, Shannon Overbay
ICCV
2007
IEEE
16 years 3 days ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
88
Voted
CIKM
2006
Springer
15 years 1 months ago
Heuristic containment check of partial tree-pattern queries in the presence of index graphs
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...
Dimitri Theodoratos, Stefanos Souldatos, Theodore ...
174
Voted
GIS
2008
ACM
15 years 11 months ago
Applying hierarchical graphs to pedestrian indoor navigation
In this paper we propose to apply hierarchical graphs to indoor navigation. The intended purpose is to guide humans in large public buildings and assist them in wayfinding. We sta...
Edgar-Philipp Stoffel, Hans Jürgen Ohlbach, K...