About: Moving vertices to make drawings plane     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • First, we show that MINMOVED-VERTICES is NP-hard and hard to approximate. Second, we establish a connection to the graph-drawing problem 1BENDPOINTSETEMBED-DABILITY, which yields similar results for that problem. Third, we give bounds for the behavior of MINMOVED VERTICES on trees and general planar graphs.
  • First, we show that MINMOVED-VERTICES is NP-hard and hard to approximate. Second, we establish a connection to the graph-drawing problem 1BENDPOINTSETEMBED-DABILITY, which yields similar results for that problem. Third, we give bounds for the behavior of MINMOVED VERTICES on trees and general planar graphs. (en)
  • Ukazujeme, že určit minimální počet vrcholů, jejichž vhodným přesunutím je možno dané nakreslení grafu planarizovat, je NP-těžké a je těžké i aproximovat. Podobný výsledek ukazujeme pro příbuznou úlohu kreslení grafů s nejvýše jedním ohybem na každé hraně. Nakonec podáváme odhady pro minimální počet planarizujících vrcholů pro stromy a obecné rovinné grafy. (cs)
Title
  • Moving vertices to make drawings plane
  • Moving vertices to make drawings plane (en)
  • Planarizace nakreslených grafů hýbáním vrcholy (cs)
skos:prefLabel
  • Moving vertices to make drawings plane
  • Moving vertices to make drawings plane (en)
  • Planarizace nakreslených grafů hýbáním vrcholy (cs)
skos:notation
  • RIV/00216208:11320/08:00101162!RIV09-MSM-11320___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), Z(MSM0021620838)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 380733
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/08:00101162
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Moving; vertices; drawings; plane (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [FA2B02F2390A]
http://linked.open...v/mistoKonaniAkce
  • Berlin
http://linked.open...i/riv/mistoVydani
  • Berlin
http://linked.open...i/riv/nazevZdroje
  • GRAPH DRAWING 2007
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Kratochvíl, Jan
  • Okamoto, Yoshio
  • Goaoc, Xavier
  • Shin, Chan-Su
  • Wolff, Alexander
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000253367700011
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
https://schema.org/isbn
  • 978-3-540-77536-2
http://localhost/t...ganizacniJednotka
  • 11320
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software