Conference ProceedingsOPEN ACCESS

Minimum length embedding of planar graphs at fixed vertex locations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 8242 LNCS 376-387
DOI: 10.1007/978-3-319-03841-4_33
11Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We consider the problem of finding a planar embedding of a graph at fixed vertex locations that minimizes the total edge length. The problem is known to be NP-hard. We give polynomial time algorithms achieving an O(√n log n) approximation for paths and matchings, and an O(n) approximation for general graphs. © 2013 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Chan, T. M., Hoffmann, H. F., Kiazyk, S., & Lubiw, A. (2013). Minimum length embedding of planar graphs at fixed vertex locations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8242 LNCS, pp. 376–387). Springer Verlag. https://doi.org/10.1007/978-3-319-03841-4_33

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