Empirical design of geometric algorithms
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Fast Layout Methods for Timetable Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
| Hi-index | 0.00 |
In a cooperation with the national German railway company, we construct a directed graph from a set of train time tables where train stations correspond to vertices, and where pairs of consecutive stops of trains correspond to edges. We consider the problem of locating vertices of this time table graph that intuitively correspond to train stations where the underlying railroad network branches into several directions, and that induce a partition of the edge set into bundles. We formulate this problem as a graph theoretic optimization problem, and show for two versions of the problem that they are NP-hard. For the first version we show that it is even NP-complete to decide whether any other solution besides the trivial one exists.