On the Hardness of Recognizing Bundles in Time Table Graphs

@inproceedings{Liebers1999OnTH,
  title={On the Hardness of Recognizing Bundles in Time Table Graphs},
  author={Annegret Liebers and Dorothea Wagner and Karsten Weihe},
  booktitle={WG},
  year={1999}
}
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… 
Recognizing Bundles in Time Table Graphs - A Structural Approach
TLDR
The structural basis of the considerations in this paper is a directed graph constructed from train time tables, where train stations correspond to vertices, and where pairs of consecutive stops of trains correspond to edges, which amounts to an edge classification problem in this graph.
Fast Layout Methods for Timetable Graphs
TLDR
This paper presents a fast layout algorithm using an entirely different approach to edge routing, based on directions of control segments rather than positions of control points, and reveals an interesting theoretical connection with Tutte's barycentric layout method.
Algorithm Engineering: 4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5–8, 2000 Proceedings
  • J. V. Leeuwen
  • Computer Science
    Lecture Notes in Computer Science
  • 2001
TLDR
It turns out that the performance of the algorithms depends heavily on the characteristics of the respective work load, and on the real world jobs the new algorithms often outperform Graham’s strategy.
A Fast Algorithm for Computing the Running-Time of Trains by Infinitesimal Calculus
We develop a fast algorithm for computing the running time (as well as energy consumption) of trains based on solving the underlying differential equation exactly, rather than applying any of the
The International Journal on Advances in Intelligent Systems is Published by IARIA
TLDR
The IARIA journals are made available for free, proving the appropriate references are made when their publication is made available at no cost.

References

SHOWING 1-10 OF 11 REFERENCES
Recognizing Bundles in Time Table Graphs - A Structural Approach
TLDR
The structural basis of the considerations in this paper is a directed graph constructed from train time tables, where train stations correspond to vertices, and where pairs of consecutive stops of trains correspond to edges, which amounts to an edge classification problem in this graph.
Using Graph Layout to Visualize Train Interconnection Data
TLDR
This work converts the problem of visualizing interconnections in railroad systems into a graph layout problem and exploits the generality of random field layout models for its solution.
The complexity of satisfiability problems
TLDR
An infinite class of satisfiability problems is considered which contains these two particular problems as special cases, and it is shown that every member of this class is either polynomial-time decidable or NP-complete.
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledge
The complexity of theorem-proving procedures
  • S. Cook
  • Mathematics, Computer Science
    STOC
  • 1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a
Empirical design of geometric algorithms
TLDR
This paper will systematically discuss the experiences with a few obstacles that occurred in four of the projects and significantly influenced the reasoning on algorithms in each of them.
Dijkstra's algorithm on-line: an empirical case study from public railroad transport
TLDR
This study considers the scenario of a central information server in the realm of public railroad transport on wide-area networks, based on the timetable data of all German trains and on a "snapshot" of half a million customer queries for Dijkstra's algorithm.
The omplexity of theoremproving pro edures
  • Pro eedings of the 3 rd Annual ACM Symposium on Theory of Computing , STOC '
  • 1971
Empiri alDesign of Geometri Algorithms
  • Konstanzer S hriften in Mathematik und Informatik 82 , Universit  at Konstanz , February
...
...