14 search results - page 1 / 3 » New Tools and Simpler Algorithms for Branchwidth |
ESA
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
SIGMOD
2011
ACM
12 years 7 months ago
2011
ACM
Debugging a database engine is an arduous task due to the complexity of the query workloads and systems. The first step in isolating a bug involves identifying a sequence of step...
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
GD
2009
Springer
13 years 9 months ago
2009
Springer
Canonical ordering is an important tool in planar graph drawing and other applications. Although a linear-time algorithm to determine canonical orderings has been known for a while...