Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

FAW
2009
Springer

favoriteEmaildiscussreport

134views Algorithms» more FAW 2009»

Pathwidth is NP-Hard for Weighted Trees

14 years 5 months ago

Pathwidth is NP-Hard for Weighted Trees

Download www.ii.uib.no

The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for particular subclasses of chordal graphs, and we deduce that the problem remains hard for weighted trees. We also discuss subclasses of chordal graphs for which the problem is polynomial.

Rodica Mihai, Ioan Todinca

Real-time Traffic

Algorithms | Chordal Graphs | FAW 2009 | Minimum Clique Number | Particular Subclasses |

claim paper

Related Content

» Routing Explicit Side Information for Data Compression in Wireless Sensor Networks

» Minimizing and Learning Energy Functions for SideChain Prediction

» On the complexity of the multicut problem in bounded treewidth graphs and digraphs

» Fixing MaxProduct Convergent Message Passing Algorithms for MAP LPRelaxations

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	FAW
Authors	Rodica Mihai, Ioan Todinca

Comments (0)