Skip to main content
Conference ProceedingsOPEN ACCESS

Drawing graphs symmetrically in three dimensions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2265 LNCS 189-204
DOI: 10.1007/3-540-45848-4_16
14Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we investigate symmetric graph drawing in three dimensions. We show that the problem of drawing a graph with a maximum number of symmetries in three dimensions is NP-hard. Then we present a polynomial time algorithm for finding maximum number of three dimensional symmetries in planar graphs. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Hong, S. H. (2002). Drawing graphs symmetrically in three dimensions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2265 LNCS, pp. 189–204). Springer Verlag. https://doi.org/10.1007/3-540-45848-4_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