Skip to main content
SpringerLink
Log in

Confluent Layered Drawings

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We combine the idea of confluent drawings with Sugiyama-style drawings in order to reduce the edge crossings in the resultant drawings. Furthermore, it is easier to understand the structures of graphs from the mixed-style drawings. The basic idea is to cover a layered graph by complete bipartite subgraphs (bicliques), then replace bicliques with tree-like structures. The biclique cover problem is reduced to a special edge-coloring problem and solved by heuristic coloring algorithms. Our method can be extended to obtain multi-depth confluent layered drawings.

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.

Similar content being viewed by others

Author information

Authors and Affiliations

  1. School of Information and Computer Science, University of California, Irvine, Irvine, CA 92697, USA

    David Eppstein, Michael T. Goodrich & Jeremy Yu Meng

Authors
  1. David Eppstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael T. Goodrich
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jeremy Yu Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to David Eppstein, Michael T. Goodrich or Jeremy Yu Meng.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Eppstein, D., Goodrich, M. & Meng, J. Confluent Layered Drawings. Algorithmica 47, 439–452 (2007). https://doi.org/10.1007/s00453-006-0159-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-006-0159-8

Keywords

Search

Navigation