Skip to main content
SpringerLink
Log in

Train Tracks and Confluent Drawings

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

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, and we show that this class coincides with the (6,2)-chordal bipartite graphs. Finally, we define outerconfluent graphs and identify the bipartite permutation graphs as a natural subclass.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Science, DePaul University, Chicago, IL 60604, USA

    Peter Hui & Marcus Schaefer

  2. Department of Applied Mathematics, Illinois Institute of Technology, Chicago, IL 60616, USA

    Michael J. Pelsmajer

  3. Computer Science Department, University of Rochester, Rochester, NY 14627-0226, USA

    Daniel Stefankovic

Authors
  1. Peter Hui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael J. Pelsmajer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marcus Schaefer
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Daniel Stefankovic
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Peter Hui, Michael J. Pelsmajer, Marcus Schaefer or Daniel Stefankovic.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hui, P., Pelsmajer, M., Schaefer, M. et al. Train Tracks and Confluent Drawings. Algorithmica 47, 465–479 (2007). https://doi.org/10.1007/s00453-006-0165-x

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-006-0165-x

Keywords

Search

Navigation