Sciweavers

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

110

Voted

STOC
2001
ACM

144views Algorithms» more STOC 2001»

Decidability of string graphs

16 years 3 months ago

Decidability of string graphs

Download people.cs.uchicago.edu

Marcus Schaefer, Daniel Stefankovic

Real-time Traffic

Algorithms | STOC 2001 |

claim paper

Related Content

» Recognizing string graphs in NP

» Formal Properties of Gene Assembly Equivalence Problem for Overlap Graphs

» Clustering of Short Strings in Large Databases

» Reachability in Unions of Commutative Rewriting Systems Is Decidable

» A Separator Theorem for String Graphs and its Applications

» Sequencing from Compomers The Puzzle

» Open Graphs and Monoidal Theories

» MicroMacro Stack Systems A New Frontier of Elementary Decidability for Sequential Systems

» Exact Distribution of Deletion Sizes for Unavoidable Strings

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2001
Where	STOC
Authors	Marcus Schaefer, Daniel Stefankovic

Comments (0)