2009•Lecture notes in computer scienceRequires access
Pathwidth is NP-Hard for Weighted Trees
Rodica Mihai, Ioan Todinca
Open publisher page 17 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Rodica Mihai, Ioan Todinca
Abstract
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 17 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Chordal graph, Pathwidth, Combinatorics, Interval graph, Treewidth, Clique, Discrete mathematics, Mathematics