On the hardness of recognizing bundles in time table graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1665, Issue , 1999, Pages 325-337

  Liebers, Annegret ^a   Wagner, Dorothea ^a   Weihe, Karsten ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

RAILROAD TRANSPORTATION; RAILROADS;

EDGE-SETS; GERMAN RAILWAYS; GRAPH-THEORETIC; NP COMPLETE; OPTIMIZATION PROBLEMS; RAILROAD NETWORKS; TIME TABLES; TRAIN STATIONS;

DIRECTED GRAPHS;

EID: 84947771194     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46784-x_31     Document Type: Conference Paper

References (4)

1. Stephen A. Cook. The complexity of theorem-proving procedures. In Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, STOC’71, pages 151-158, 1971. 329
2. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of N P-Completeness. W H Freeman & Co Ltd, 1979. 327, 329, 333
3. Thomas J. Schaefer. The complexity of satisfiability problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing, STOC’78, pages 216-226, 1978. 333
4. Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, and Thomas Willhalm. Empirical Design of Geometric Algorithms. In Proceedings of the 15th ACM Symposium on Computational Geometry, SCG’99, pages 86-94, 1999. 326