Skip to main content
Conference ProceedingsOPEN ACCESS

Delta-confluent drawings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3843 LNCS 165-176
DOI: 10.1007/11618058_16
22Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We generalize the tree-confluent graphs to a broader class of graphs called Δ-confluent graphs. This class of graphs and distance-hereditary graphs, a well-known class of graphs, coincide. Some results about the visualization of Δ-confluent graphs are also given. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Eppstein, D., Goodrich, M. T., & Meng, J. Y. (2006). Delta-confluent drawings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3843 LNCS, pp. 165–176). https://doi.org/10.1007/11618058_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free