About: Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface 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)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. (en)
Title	Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface (en)
skos:prefLabel	Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface (en)
skos:notation	RIV/00216224:14330/10:00043102!RIV11-GA0-14330___
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(1M0545), P(GA201/08/0308), S, Z(MSM0021622419)
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	Hliněný, Petr Chimani, Markus
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	247583
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/10:00043102
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	crossing number; crossing minimization; surface (en)
http://linked.open.../riv/klicoveSlovo	surface crossing minimization crossing number
http://linked.open...ontrolniKodProRIV	[E4A44AEC715F]
http://linked.open...v/mistoKonaniAkce	Austin, Texas
http://linked.open...i/riv/mistoVydani	USA, internet
http://linked.open...i/riv/nazevZdroje	ACM-SIAM Symposium on Discrete Algorithms (SODA 2010)
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Institute for Theoretical Computer Science Utilization of structural and %22Width%22 parameters in combinatorics and algorithmic complexity
http://linked.open...UplatneniVysledku	2010
http://linked.open...iv/tvurceVysledku	Chimani, Markus Hliněný, Petr
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000280699900074
http://linked.open.../riv/zahajeniAkce	2010-01-17 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Highly Parallel and Distributed Computing Systems
number of pages	10 (xsd:int)
http://purl.org/ne...btex#hasPublisher	SIAM / ACM
https://schema.org/isbn	978-0-89871-698-6
http://localhost/t...ganizacniJednotka	14330

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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, 24 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software