Decidability of string graphs

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 241-246

  Schaefer, M ^a   Stefankovic D ^a  

^a DEPAUL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; PROBLEM SOLVING; THEOREM PROVING;

EULER GRAPHS;

GRAPH THEORY;

EID: 0034826218     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380807     Document Type: Conference Paper

References (19)

1. Maintaining knowledge about temporal intervals
2. Planar map graphs
3. How to draw a planar graph on a grid
4. Reasoning about binary topological relations
5. Intersection graphs of curves in the plane
6. Crossing number is NP-complete
7. Problem 1
8. Topological inference
9. Computing crossing numbers in quadratic time
10. The computational complexity of knot and link problems
11. String graphs. I. The number of critical nonstring graphs is infinite
12. String graphs. II. Recognizing string graphs is NP-hard
13. Crossing number of abstract topological graphs
14. String graphs requiring exponential representations
15. Spatial logic and the complexity of diagrammmatic reasoning
16. Topological queries in spatial databases
17. Embedding planar graphs on the grid
18. Topology of thin film circuits