Sciweavers

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

30

IPL
2008

favoriteEmaildiscussreport

84views more IPL 2008»

Minimal proper interval completions

13 years 11 months ago

Minimal proper interval completions

Download www.dim.uchile.cl

Given an arbitrary graph G = (V, E) and a proper interval graph H = (V, F) with E F we say that H is a proper interval completion of G. The graph H is called a minimal proper interval completion of G if, for any sandwich graph H = (V, F ) with E F F, H is not a proper interval graph. In this paper we give a O(n + m) time algorithm computing a minimal proper interval completion of an arbitrary graph. The output is a proper interval model of the completion.

Ivan Rapaport, Karol Suchan, Ioan Todinca

Real-time Traffic

IPL 2008 | Proper Interval | Proper Interval Completion | Proper Interval Graph |

claim paper

Related Content

» Minimal Interval Completions

» Polynomial kernels for Proper Interval Completion and related problems

» Induced Subgraph Isomorphism on Interval and Proper Interval Graphs

» Characterizing Minimal Interval Completions

» Minimizing total busy time in parallel scheduling with application to optical networks

» A New Modal Approach to the Logic of Intervals

» A characterization of uniquely vertex colorable graphs using minimal defining sets

» Minimizing Busy Time in Multiple Machine Realtime Scheduling

» Tableau Systems for Logics of Subinterval Structures over Dense Orderings

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	IPL
Authors	Ivan Rapaport, Karol Suchan, Ioan Todinca

Comments (0)