6 search results - page 2 / 2 » Exact Algorithms for Treewidth and Minimum Fill-In |
137
Voted
DAM
2007
15 years 2 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...