1402 search results - page 1 / 281 » Searching Cycle-Disjoint Graphs |
COCOA
2007
Springer
13 years 11 months ago
2007
Springer
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 ...
NETWORKS
2010
13 years 3 months ago
2010
We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.
STOC
1996
ACM
13 years 9 months ago
1996
ACM
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
IANDC
2008
13 years 4 months ago
2008
Search games are attractive for their correspondence with classical width parameters. For instance, the invisible search number (a.k.a. node search number) of a graph is equal to