Searching for "Dynamic Programming on Graphs with Bounded Treewidth." – sorted by Relevance.
7 documents found, showing 1 through 7.
-
Dynamic Programming On Graphs With Bounded Treewidth
- …, MASSACHUSETTS 02139 Dynamic Programming on Graphs with Bounded Treewidth Hans L. Bodlaender Laboratory…
- Cited by 34 (0 self) – Add To MetaCart
-
Branching and treewidth based exact algorithms
- … & Reduce and dynamic programming on graphs of bounded treewidth are among the most common and powerful…
- Cited by 4 (1 self) – Add To MetaCart
-
On Linear Time Minor Tests And Depth First Search
- … and on dynamic programming on graphs with bounded treewidth. As a corollary, it follows that the MAXIMUM LEAF…
- Add To MetaCart
-
Improved algorithms and complexity results for power domination
- … that Power Dominating Set can be solved by “bounded-treewidth dynamic programs.” Moreover, we simplify…
- Cited by 7 (2 self) – Add To MetaCart
-
Equitable Colorings of Bounded Treewidth Graphs
- … from the standard dynamic programming on graphs of bounded treewidth. To convince the reader (and…
- Cited by 5 (0 self) – Add To MetaCart
-
Subexponential Parameterized Algorithms on Graphs of Bounded Genus and H-Minor-Free Graphs
- … to the problem. If treewidth is ≤ c � P (G) run standard dynamic programming on graph of bounded treewidth which…
- Cited by 15 (6 self) – Add To MetaCart
-
Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions
- … of dynamic programming on graphs of bounded treewidth (or branchwidth) [6]. For example, it can be shown that…
- Cited by 18 (11 self) – Add To MetaCart
Showing 1 through 7.
