This HTML5 document contains 46 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n15http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n21http://purl.org/net/nknouf/ns/bibtex#
n9http://localhost/temp/predkladatel/
n19http://linked.opendata.cz/resource/domain/vavai/projekt/
n4http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n20http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F14%3A10284087%21RIV15-GA0-11320___/
n17http://linked.opendata.cz/ontology/domain/vavai/
n14https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n16http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F14%3A10284087%21RIV15-GA0-11320___
rdf:type
n17:Vysledek skos:Concept
dcterms: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. 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.
dcterms:title
Drawing Simultaneously Embedded Graphs with Few Bends Drawing Simultaneously Embedded Graphs with Few Bends
skos:prefLabel
Drawing Simultaneously Embedded Graphs with Few Bends Drawing Simultaneously Embedded Graphs with Few Bends
skos:notation
RIV/00216208:11320/14:10284087!RIV15-GA0-11320___
n3:aktivita
n13:P
n3:aktivity
P(GA14-14179S)
n3:dodaniDat
n12:2015
n3:domaciTvurceVysledku
n4:1123580 Rutter, Ignaz
n3:druhVysledku
n8:D
n3:duvernostUdaju
n18:S
n3:entitaPredkladatele
n20:predkladatel
n3:idSjednocenehoVysledku
12362
n3:idVysledku
RIV/00216208:11320/14:10284087
n3:jazykVysledku
n6:eng
n3:klicovaSlova
straight-line drawing; bends; simultaneous drawing; graph drawing
n3:klicoveSlovo
n5:graph%20drawing n5:bends n5:straight-line%20drawing n5:simultaneous%20drawing
n3:kontrolniKodProRIV
[F113696A3E00]
n3:mistoKonaniAkce
Wurzburg
n3:mistoVydani
Berlin
n3:nazevZdroje
Graph Drawing
n3:obor
n22:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
4
n3:projekt
n19:GA14-14179S
n3:rokUplatneniVysledku
n12:2014
n3:tvurceVysledku
Rutter, Ignaz Grilli, Luca Kratochvíl, Jan Hong, Seok-Hee
n3:typAkce
n15:WRD
n3:zahajeniAkce
2014-09-24+02:00
s:issn
0302-9743
s:numberOfPages
12
n16:doi
10.1007/978-3-662-45803-7_4
n21:hasPublisher
Springer-Verlag
n14:isbn
978-3-662-45802-0
n9:organizacniJednotka
11320