Results 131 to 140 of about 1,033 (146)

Pathwidth and Searching in Parameterized Threshold Graphs

2010
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.
D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shashank, C. Pandu Rangan   +3 more
openaire   +1 more source

Submodular Minimization via Pathwidth

2012
In this paper, we present a submodular minimization algorithm based on a new relationship between minimizers of a submodular set function and pathwidth defined on submodular set functions. Given a submodular set function f on a finite set V with n ≥2 elements and an ordered pair s ,t ∈V , let λ s ,t denote the minimum f (X ) over all sets X with s ∈X ...
openaire   +2 more sources

Treewidth, Pathwidth and Cospan Decompositions.

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2011
OA ...
Blume, Christoph, Sander Bruggink, H.J., Friedrich, Martin, König, Barbara   +3 more
openaire   +2 more sources

Approximating Pathwidth for Graphs of Small Treewidth

ACM Transactions on Algorithms, 2023
Wojciech Nadara, Bartosz Walczak, Gwenaël Joret   +2 more
exaly  

Pathwidth of pathwidth-bounded graphs

2006
openaire   +1 more source

The Pathwidth and Treewidth of Cographs

SIAM Journal on Discrete Mathematics, 1993
Hans L. Bodlaender, Rolf H. Möhring
exaly  

Approximation of pathwidth of outerplanar graphs

Journal of Algorithms, 2002
Hans L. Bodlaender, Fedor Fomin
exaly  

Pagenumber of pathwidth- graphs and strong pathwidth- graphs

Discrete Mathematics, 2002
Koichi Yamazaki
exaly  

Minor-Closed Graph Classes with Bounded Layered Pathwidth

SIAM Journal on Discrete Mathematics, 2020
Vida Dujmović, David Wood, Gwenaël Joret   +2 more
exaly  

Circumference and Pathwidth of Highly Connected Graphs

Journal of Graph Theory, 2015
David Wood
exaly