Train Tracks and Confluent Drawings
Confluent graphs capture the connection properties of train tracks, offering a very natural generalization of planar graphs, and – as the example of railroad maps shows – are an important tool in graph visualization. In this paper we continue the study of confluent graphs, introducing strongly confluent graphs and tree-confluent graphs. We show that strongly confluent graphs can be recognized in NP (the complexity of recognizing confluent graphs remains open). We also give a natural elimination ordering characterization of tree-confluent graphs which shows that they form a subclass of the chordal bipartite graphs, and can be recognized in polynomial time.
- 3.Eppstein, D.: Personal communication (2004)Google Scholar
- 6.Penner, R.C., Harer, J.L.: Combinatorics of train tracks. Annals of mathematics studies, vol. 125. Princeton University Press, Princeton (1992)Google Scholar
- 7.Schaefer, M., Sedgwick, E., Štefankovič, D.: Recognizing string graphs in NP. J. Comput. System Sci. 67(2), 365–380 (2003); Special issue on STOC 2002, Montreal, QCGoogle Scholar