Article

Free access

Small sets supporting fary embeddings of planar graphs

Authors:

Hubert de Fraysseix,

Richard PollackAuthors Info & Claims

STOC '88: Proceedings of the twentieth annual ACM symposium on Theory of computing

Pages 426 - 433

https://doi.org/10.1145/62212.62254

Published: 01 January 1988 Publication History

Abstract

Answering a question of Rosenstiehl and Tarjan, we show that every plane graph with n vertices has a Fáry embedding (i.e., straight-line embedding) on the 2n - 4 by n - 2 grid and provide an Ο(n) space, Ο(n log n) time algorithm to effect this embedding. The grid size is asymptotically optimal and it had been previously unknown whether one can always find a polynomial sized grid to support such an embedding. On the other hand we show that any set F, which can support a Fáry embedding of every planar graph of size n, has cardinality at least n + (1 - ο(1)) √n which settles a problem of Mohar.

References

[1]

B. CHAZELLE Slimming down .~earch structures:a functional approach to algorithm design, in tUroceedin~Is of the Twenty Sixth Annua. l Symposium on the {~bundat/ons of C.,'omputer,~'ci. ence. 1~)85, pp. 165-174.

Digital Library

[2]

N. CmnA, T. YA~ANOUCnX,~Nt) T. N).~!ZZK1. Linear algorJthms for convex drawings of planar graph.in progress in ~raph theory, 1982, pp. 153-173.

[3]

P. D,CitET, Y. HAMIDOUNE. M. LAs VER(;NAS, AND H. MEYNIEL. Representing a planar graph by vertical !iues joining ditferent intervals, Discrete Math., 46 (1983), {)Is. 319-321.

Digital Library

[4]

l. FARY, On straight }i~e reprosenting of p~anar graphs, Acta. qci. Math. (Szegetl), ii (1948}. pp. 229-233.

[5]

H. DE FHAYSSEIX, Drawing planar and non planar graphs from the half-e~!ge code, (to appear).

[6]

H. DE FHAYSSEIX, AND P. ROSENFIELD, .structure combinatoires !~,ur tt~ces amtomagiql~e.do resaux,in proceedings of the ~J'hird gtaropean Conlgeren,'e on CAD CAM and computer Graphics, 1984, pp. 332-337.

[7]

H. DE FRAYSSEIX AND P. ROSENSTIEHL. L'alg,)rithme Gauchedroite pour le plongement des graphes dans le plan, (to appear).

[8]

D. Fi. (3asEl~, efficient coding and drawing of planar graphs, Xerox PMo Alto Rese&rch Center. Palo Alto, CA.

[9]

G. GI~/J~TBAUM, Convex Polytopes, John Wiley.

[10]

J. Hopcroft and R.Tarjan.efficient planarity testing, J. Comput. Math., 21 (1974), pp. 549-568.

Digital Library

[11]

F.T. LmO~TON, Complexity Issues in VLSI, The MIT Press.

[12]

B. MO~Aa, private communication.

[13]

R. H. J. M, OTTEN.~D J. G. v~,N WtJK. Graph representation in interactive layout design, in Proceedings of the IEEE International Symposium on Circuits and Systems, 1978, pp, ~14-918.

[14]

P.ROSENSTIEHL, Embedding in the plane with orientation con- .~traints. Ann. N. Y. Acad. Sci. (to appear).

[15]

R.C. RIs~,I), A new method for drafting a planar graph given the cyclic order o{ the edges at each vertex. Congres,s Numerantium, 56, pp. 31-44.

[16]

P. ROSENSTIEltL, A~D R. E. TAItJAN. Rectilinear,planarlayout.~ and bipolar orientations of planar graphs. Disc. Comp.Geom 1 (1986)' pp' 343--353'

Digital Library

[17]

R' TOM'MaSlA AND I. G. TOLLIS. A united approach to visit bilitr repre~entati,ms o{ planar graphs, Disc. Comp.Geom.,i (1986;, pp. 3'21-341.

[18]

w.T. 'rrrvz. How to drawa graph. Pro~. Lt)mion Math.,'qoc., 13 t 19631, pp. 743-768.

[19]

J.D. ULLMAN, Computational Aspects,of VLsI, Computer Sci- ~nc e Press.

Digital Library

[20]

L G. VALIANT. university considerations in VLSI circuits. iEEE Trans, on Computers ('-30. pp. 135-140.

Digital Library

[21]

D.R. WOODS. Drawing planar graphs, in Report N. STAN-CS-- S2-943, Computer Science Department, Stanford University, CA, 198I.

Cited By

Bekos MGronemann MMontecchiani FSymvonis A(2024)Convex grid drawings of planar graphs with constant edge-vertex resolutionTheoretical Computer Science10.1016/j.tcs.2023.114290982:COnline publication date: 8-Jan-2024
https://dl.acm.org/doi/10.1016/j.tcs.2023.114290
Da Lozzo GDi Battista GFrati FGrosso FPatrignani M(2024)Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar GraphsWALCOM: Algorithms and Computation10.1007/978-981-97-0566-5_25(350-364)Online publication date: 29-Feb-2024
https://doi.org/10.1007/978-981-97-0566-5_25
Bernardi OFusy ÉLiang S(2024)A Schnyder-Type Drawing Algorithm for 5-Connected TriangulationsGraph Drawing and Network Visualization10.1007/978-3-031-49275-4_8(117-132)Online publication date: 6-Jan-2024
https://doi.org/10.1007/978-3-031-49275-4_8
Show More Cited By

Index Terms

Small sets supporting fary embeddings of planar graphs
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

Domination in planar graphs with small diameter

MacGillivray and Seyffarth (J Graph Theory 22 (1996), 213–229) proved that planar graphs of diameter two have domination number at most three and planar graphs of diameter three have domination number at most ten. They also give examples of planar ...
Clique-transversal sets and clique-coloring in planar graphs

Let G=(V,E) be a graph. A clique-transversal setD is a subset of vertices of G such that D meets all cliques of G, where a clique is defined as a complete subgraph maximal under inclusion and having at least two vertices. The clique-transversal number, ...
Domination and dominator colorings in planar graphs with small diameter
Abstract
A dominator coloring of a graph G is a proper coloring of the vertices of G in which each vertex of the graph dominates every vertex of some color class, where a vertex dominates itself and all vertices adjacent to it. The dominator ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '88: Proceedings of the twentieth annual ACM symposium on Theory of computing

January 1988

553 pages

ISBN:0897912640

DOI:10.1145/62212

Chairman:
J'anos Simon
Univ. of Chicago, Illinois

Copyright © 1988 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1988

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC88

Sponsor:

SIGACT

STOC88: 1988 Symposium on the Theory of Computing

May 2 - 4, 1988

Illinois, Chicago, USA

Acceptance Rates

STOC '88 Paper Acceptance Rate 53 of 192 submissions, 28%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

95
Total Citations
View Citations
855
Total Downloads

Downloads (Last 12 months)76
Downloads (Last 6 weeks)11

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Bekos MGronemann MMontecchiani FSymvonis A(2024)Convex grid drawings of planar graphs with constant edge-vertex resolutionTheoretical Computer Science10.1016/j.tcs.2023.114290982:COnline publication date: 8-Jan-2024
https://dl.acm.org/doi/10.1016/j.tcs.2023.114290
Da Lozzo GDi Battista GFrati FGrosso FPatrignani M(2024)Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar GraphsWALCOM: Algorithms and Computation10.1007/978-981-97-0566-5_25(350-364)Online publication date: 29-Feb-2024
https://doi.org/10.1007/978-981-97-0566-5_25
Bernardi OFusy ÉLiang S(2024)A Schnyder-Type Drawing Algorithm for 5-Connected TriangulationsGraph Drawing and Network Visualization10.1007/978-3-031-49275-4_8(117-132)Online publication date: 6-Jan-2024
https://doi.org/10.1007/978-3-031-49275-4_8
Seemann CMoulton VStadler PHellmuth M(2023)Planar median graphs and cubesquare-graphsDiscrete Applied Mathematics10.1016/j.dam.2023.01.022331:C(38-58)Online publication date: 31-May-2023
https://dl.acm.org/doi/10.1016/j.dam.2023.01.022
Brand CGanian RRöder SSchager F(2023)Fixed-Parameter Algorithms for Computing RAC Drawings of GraphsGraph Drawing and Network Visualization10.1007/978-3-031-49275-4_5(66-81)Online publication date: 20-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-49275-4_5
Bekos MGronemann MMontecchiani FSymvonis A(2022)Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex ResolutionCombinatorial Algorithms10.1007/978-3-031-06678-8_12(157-171)Online publication date: 29-May-2022
https://doi.org/10.1007/978-3-031-06678-8_12
Bekos MGronemann MMontecchiani FPálvölgyi DSymvonis ATheocharous L(2021)Grid drawings of graphs with constant edge-vertex resolutionComputational Geometry: Theory and Applications10.1016/j.comgeo.2021.10178998:COnline publication date: 1-Oct-2021
https://dl.acm.org/doi/10.1016/j.comgeo.2021.101789
Chen FWang YWang BKuo C(2020)Graph representation learning: a surveyAPSIPA Transactions on Signal and Information Processing10.1017/ATSIP.2020.139:1Online publication date: 2020
https://doi.org/10.1017/ATSIP.2020.13
Dieng YGavoille C(2020)On the Treewidth of Planar Minor Free GraphsInnovations and Interdisciplinary Solutions for Underserved Areas10.1007/978-3-030-51051-0_17(238-250)Online publication date: 6-Aug-2020
https://doi.org/10.1007/978-3-030-51051-0_17
Schlipf LSchmidt J(2019)Edge-OrdersAlgorithmica10.1007/s00453-018-0516-481:5(1881-1900)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1007/s00453-018-0516-4
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents