Drawing Simultaneously Embedded Graphs with Few Bends
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10284087" target="_blank" >RIV/00216208:11320/14:10284087 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-662-45803-7_4" target="_blank" >http://dx.doi.org/10.1007/978-3-662-45803-7_4</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-662-45803-7_4" target="_blank" >10.1007/978-3-662-45803-7_4</a>
Alternative languages
Result language
angličtina
Original language name
Drawing Simultaneously Embedded Graphs with Few Bends
Original language description
We study the problem of drawing simultaneously embedded graphs with few bends. We show that for any simultaneous embedding with fixed edges (Sefe) of two graphs, there exists a corresponding drawing realizing this embedding such that common edges are drawn as straight-line segments and each exclusive edge has a constant number of bends. If the common graph is biconnected and induced, a straight-line drawing exists. This yields the first efficient testing algorithm for simultaneous geometric embedding (Sge) for a non-trivial class of graphs.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA14-14179S" target="_blank" >GA14-14179S: Algorithmic, structural and complexity aspects of configurations in the plane</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Graph Drawing
ISBN
978-3-662-45802-0
ISSN
0302-9743
e-ISSN
—
Number of pages
12
Pages from-to
40-51
Publisher name
Springer
Place of publication
Berlin
Event location
Wurzburg
Event date
Sep 24, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—