3 search results - page 1 / 1 » Pathwidth and Searching in Parameterized Threshold Graphs |
WALCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
FSTTCS
2007
Springer
13 years 11 months ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...