About: Better Polynomial Algorithms on Graphs of Bounded Rank-width.

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

About: Better Polynomial Algorithms on Graphs of Bounded Rank-width. 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	Although there exist many polynomial algorithms for NP-hard problems running on a bounded clique-width expression of the input graph, there exists only little comparable work on such algorithms for rank-width. We believe that one reason for this is the somewhat obscure and hard-to-grasp nature of rank-decompositions. Nevertheless, strong arguments for using the rank-width parameter have been given by recent formalisms independently developed by Courcelle and Kante, by the authors, and by Bui-Xuan et al. This article focuses on designing formally clean and understandable %22pseudopolynomial%22 (XP) algorithms solving %22hard%22 problems (non-FPT) on graphs of bounded rank-width. Those include computing the chromatic number and polynomial or testing the Hamiltonicity of a graph and are extendable to many other problems. Although there exist many polynomial algorithms for NP-hard problems running on a bounded clique-width expression of the input graph, there exists only little comparable work on such algorithms for rank-width. We believe that one reason for this is the somewhat obscure and hard-to-grasp nature of rank-decompositions. Nevertheless, strong arguments for using the rank-width parameter have been given by recent formalisms independently developed by Courcelle and Kante, by the authors, and by Bui-Xuan et al. This article focuses on designing formally clean and understandable %22pseudopolynomial%22 (XP) algorithms solving %22hard%22 problems (non-FPT) on graphs of bounded rank-width. Those include computing the chromatic number and polynomial or testing the Hamiltonicity of a graph and are extendable to many other problems. (en)
Title	Better Polynomial Algorithms on Graphs of Bounded Rank-width. Better Polynomial Algorithms on Graphs of Bounded Rank-width. (en)
skos:prefLabel	Better Polynomial Algorithms on Graphs of Bounded Rank-width. Better Polynomial Algorithms on Graphs of Bounded Rank-width. (en)
skos:notation	RIV/00216224:14330/09:00065861!RIV14-MSM-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	2014
http://linked.open...aciTvurceVysledku	Ganian, Robert Hliněný, Petr
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	304931
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/09:00065861
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	rank-width; parameterized algorithms; graphs (en)
http://linked.open.../riv/klicoveSlovo	graphs rank-width parameterized algorithms
http://linked.open...ontrolniKodProRIV	[8B242D585955]
http://linked.open...v/mistoKonaniAkce	Hradec nad Moravicí
http://linked.open...i/riv/mistoVydani	Berlin
http://linked.open...i/riv/nazevZdroje	IWOCA 2009: International Workshop On Combinatorial Algorithms, Lecture Notes in Computer Science 5874
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	2009
http://linked.open...iv/tvurceVysledku	Ganian, Robert Hliněný, Petr
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000280084100026
http://linked.open.../riv/zahajeniAkce	2009-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Highly Parallel and Distributed Computing Systems
issn	0302-9743
number of pages	12 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-10217-2
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	9783642102165
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