Sciweavers

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

113

ARSCOM
2006

96views more ARSCOM 2006»

The Weighted Integrity Problem is Polynomial for Interval Graphs

15 years 2 months ago

The Weighted Integrity Problem is Polynomial for Interval Graphs

Download cs.ua.edu

Sibabrata Ray, Rajgopal Kannan, Danyang Zhang, Hon

Real-time Traffic

ARSCOM 2006 |

claim paper

Related Content

» Pathwidth is NPHard for Weighted Trees

» Some tractable instances of interval data minmax regret problems

» Clique Clustering Yields a PTAS for maxColoring Interval Graphs

» Polynomial kernels for Proper Interval Completion and related problems

» Subcoloring and Hypocoloring Interval Graphs

» The Longest Path Problem Is Polynomial on Interval Graphs

» Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangemen...

» A polynomial solution to the kfixedendpoint path cover problem on proper interval graphs

» The 1FixedEndpoint Path Cover Problem is Polynomial on Interval Graphs

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2006
Where	ARSCOM
Authors	Sibabrata Ray, Rajgopal Kannan, Danyang Zhang, Hong Jiang

Comments (0)