Sciweavers

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

9

SODA
2003
ACM

favoriteEmaildiscussreport

120views Algorithms» more SODA 2003»

Certifying algorithms for recognizing interval graphs and permutation graphs

13 years 5 months ago

Certifying algorithms for recognizing interval graphs and permutation graphs

Download www.cs.colostate.edu

Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn,

Real-time Traffic

Algorithms | SODA 2003 |

claim paper

Related Content

» Recognizing dInterval Graphs and dTrack Interval Graphs

» An O nm Time Certifying Algorithm for Recognizing HHDFree Graphs

» A New Intersection Model and Improved Algorithms for Tolerance Graphs

» A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs

» Computing Common Intervals of K Permutations with Applications to Modular Decomposition of...

» Recognizing and representing proper interval graphs in parallel using merging and sorting

» Canonical Data Structure for Interval Probe Graphs

» Proper Helly CircularArc Graphs

» The Simultaneous Representation Problem for Chordal Comparability and Permutation Graphs

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2003
Where	SODA
Authors	Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad

Comments (0)