Recognizing string graphs in NP

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 1-6

  Schaefer, Marcus ^a   Sedgwick, Eric ^a   Štefankovič, Daniel ^a  

^a DEPAUL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; DRAWING (GRAPHICS); POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

RECOGNITION PROBLEM; STRING GRAPHS; TOPOLOGICAL INFERENCE; WEAK REALIZABILITY PROBLEM;

GRAPH THEORY;

EID: 0036038987     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509909.509910     Document Type: Conference Paper

References (22)

1. On the topology of the genetic fine structure
2. Planar map graphs
3. Existential theory of equations with rational constraints in free groups is PSPACE-complete
4. Solving trace equations using lexicographical normal forms
5. Solvability of equations in free partially commutative groups is decidable
6. Homeomorphisms and simple closed curves
7. Crossing number is NP-complete
8. Efficient algorithms for lempel-ziv encoding
9. Topological inference
10. String graphs. I. The number of critical nonstring graphs is infinite
11. String graphs. II. Recognizing string graphs is NP-hard
12. Crossing number of abstract topological graphs
13. String graphs requiring exponential representations
14. Algebraic combinatorics on words
15. On polynomial time decidability of induced-minor-closed classes
16. Which crossing number is it anyway?
17. Recognizing string graphs is decidable
18. Application of Lempel-Ziv encodings to the solution of words equations
19. Decidability of string graphs
20. Topology of thin film circuits
21. Map graphs in polynomial time