About: Simple realizability of complete abstract topological graphs in P     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
rdfs:seeAlso
Description
  • An abstract topological graph (briefly an AT-graph) is a pair A=(G,R) where G=(V,E) is a graph and R is a set of pairs of its edges. An AT-graph A is simply realizable if G can be drawn in the plane in such a way that each pair of edges from R crosses exactly once and no other pair crosses. We present a polynomial algorithm which decides whether a given complete AT-graph is simply realizable. On the other hand, we show that other similar realizability problems for (complete) AT-graphs are NP-hard.
  • An abstract topological graph (briefly an AT-graph) is a pair A=(G,R) where G=(V,E) is a graph and R is a set of pairs of its edges. An AT-graph A is simply realizable if G can be drawn in the plane in such a way that each pair of edges from R crosses exactly once and no other pair crosses. We present a polynomial algorithm which decides whether a given complete AT-graph is simply realizable. On the other hand, we show that other similar realizability problems for (complete) AT-graphs are NP-hard. (en)
Title
  • Simple realizability of complete abstract topological graphs in P
  • Simple realizability of complete abstract topological graphs in P (en)
skos:prefLabel
  • Simple realizability of complete abstract topological graphs in P
  • Simple realizability of complete abstract topological graphs in P (en)
skos:notation
  • RIV/00216208:11320/11:10080461!RIV12-MSM-11320___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545)
http://linked.open...iv/cisloPeriodika
  • 3
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
  • 229303
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/11:10080461
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Simple realizability; Simple complete topological graph; Abstract topological graph (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • DE - Spolková republika Německo
http://linked.open...ontrolniKodProRIV
  • [0D87305D4235]
http://linked.open...i/riv/nazevZdroje
  • Discrete and Computational Geometry
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...v/svazekPeriodika
  • 45
http://linked.open...iv/tvurceVysledku
  • Kynčl, Jan
http://linked.open...ain/vavai/riv/wos
  • 000287146600002
issn
  • 0179-5376
number of pages
http://bibframe.org/vocab/doi
  • 10.1007/s00454-010-9320-x
http://localhost/t...ganizacniJednotka
  • 11320
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, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software