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
n13http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n10http://localhost/temp/predkladatel/
n3http://purl.org/net/nknouf/ns/bibtex#
n17http://linked.opendata.cz/resource/domain/vavai/projekt/
n8http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n16http://linked.opendata.cz/ontology/domain/vavai/
n11https://schema.org/
n19http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F10%3A00043102%21RIV11-GA0-14330___/
n7http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n21http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n14http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F10%3A00043102%21RIV11-GA0-14330___
rdf:type
skos:Concept n16:Vysledek
dcterms:description
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an $O(n\log n)$ time constant factor approximation algorithm for the crossing number of a graph of bounded maximum degree which is ``densely enough'' embeddable in an arbitrary fixed orientable surface. The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an $O(n\log n)$ time constant factor approximation algorithm for the crossing number of a graph of bounded maximum degree which is ``densely enough'' embeddable in an arbitrary fixed orientable surface.
dcterms:title
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
skos:prefLabel
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
skos:notation
RIV/00216224:14330/10:00043102!RIV11-GA0-14330___
n6:aktivita
n9:S n9:P n9:Z
n6:aktivity
P(1M0545), P(GA201/08/0308), S, Z(MSM0021622419)
n6:dodaniDat
n14:2011
n6:domaciTvurceVysledku
n8:7595646 Chimani, Markus
n6:druhVysledku
n18:D
n6:duvernostUdaju
n22:S
n6:entitaPredkladatele
n19:predkladatel
n6:idSjednocenehoVysledku
247583
n6:idVysledku
RIV/00216224:14330/10:00043102
n6:jazykVysledku
n15:eng
n6:klicovaSlova
crossing number; crossing minimization; surface
n6:klicoveSlovo
n21:crossing%20minimization n21:crossing%20number n21:surface
n6:kontrolniKodProRIV
[E4A44AEC715F]
n6:mistoKonaniAkce
Austin, Texas
n6:mistoVydani
USA, internet
n6:nazevZdroje
ACM-SIAM Symposium on Discrete Algorithms (SODA 2010)
n6:obor
n20:IN
n6:pocetDomacichTvurcuVysledku
2
n6:pocetTvurcuVysledku
2
n6:projekt
n17:GA201%2F08%2F0308 n17:1M0545
n6:rokUplatneniVysledku
n14:2010
n6:tvurceVysledku
Hliněný, Petr Chimani, Markus
n6:typAkce
n13:WRD
n6:wos
000280699900074
n6:zahajeniAkce
2010-01-17+01:00
n6:zamer
n7:MSM0021622419
s:numberOfPages
10
n3:hasPublisher
SIAM / ACM
n11:isbn
978-0-89871-698-6
n10:organizacniJednotka
14330