Sciweavers

40
Voted
WALCOM
2010
IEEE

Pathwidth and Searching in Parameterized Threshold Graphs

13 years 9 months ago
Pathwidth and Searching in Parameterized Threshold Graphs
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 chordal and threshold graphs. We define a chordal + 1v graph as a graph that can be made into a chordal graph by removing a vertex. We give polynomial time algorithms for computing the treewidth of a chordal + 1v graph, pathwidth of a threshold + 1v graph and a threshold + 2e graph. The mixed search number of a graph is the minimum number of cops required to capture a single robber, who is hiding in the graph. We apply the algorithm to compute the pathwidth in order to compute the mixed search number of a threshold + 1v graph.
D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shas
Added 31 Jan 2011
Updated 31 Jan 2011
Type Journal
Year 2010
Where WALCOM
Authors D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shashank, C. Pandu Rangan
Comments (0)