Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
11
click to vote
ARSCOM
2006
favorite
Email
discuss
report
96
views
more
ARSCOM 2006
»
The Weighted Integrity Problem is Polynomial for Interval Graphs
13 years 4 months ago
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
more »
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)
Researcher Info
ARSCOM 2008 Study Group
Computer Vision