This HTML5 document contains 48 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n17http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n8http://purl.org/net/nknouf/ns/bibtex#
n7http://localhost/temp/predkladatel/
n19http://linked.opendata.cz/resource/domain/vavai/projekt/
n6http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n21http://linked.opendata.cz/ontology/domain/vavai/
n23http://linked.opendata.cz/resource/domain/vavai/zamer/
n13https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n11http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n20http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F09%3A00065861%21RIV14-MSM-14330___/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n9http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n10http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F09%3A00065861%21RIV14-MSM-14330___
rdf:type
skos:Concept n21:Vysledek
dcterms: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.
dcterms:title
Better Polynomial Algorithms on Graphs of Bounded Rank-width. Better Polynomial Algorithms on Graphs of Bounded Rank-width.
skos:prefLabel
Better Polynomial Algorithms on Graphs of Bounded Rank-width. Better Polynomial Algorithms on Graphs of Bounded Rank-width.
skos:notation
RIV/00216224:14330/09:00065861!RIV14-MSM-14330___
n3:aktivita
n9:S n9:P n9:Z
n3:aktivity
P(1M0545), P(GA201/08/0308), S, Z(MSM0021622419)
n3:dodaniDat
n10:2014
n3:domaciTvurceVysledku
n6:7595646 n6:6376290
n3:druhVysledku
n22:D
n3:duvernostUdaju
n14:S
n3:entitaPredkladatele
n20:predkladatel
n3:idSjednocenehoVysledku
304931
n3:idVysledku
RIV/00216224:14330/09:00065861
n3:jazykVysledku
n5:eng
n3:klicovaSlova
rank-width; parameterized algorithms; graphs
n3:klicoveSlovo
n12:rank-width n12:parameterized%20algorithms n12:graphs
n3:kontrolniKodProRIV
[8B242D585955]
n3:mistoKonaniAkce
Hradec nad Moravicí
n3:mistoVydani
Berlin
n3:nazevZdroje
IWOCA 2009: International Workshop On Combinatorial Algorithms, Lecture Notes in Computer Science 5874
n3:obor
n16:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n19:1M0545 n19:GA201%2F08%2F0308
n3:rokUplatneniVysledku
n10:2009
n3:tvurceVysledku
Hliněný, Petr Ganian, Robert
n3:typAkce
n17:WRD
n3:wos
000280084100026
n3:zahajeniAkce
2009-01-01+01:00
n3:zamer
n23:MSM0021622419
s:issn
0302-9743
s:numberOfPages
12
n11:doi
10.1007/978-3-642-10217-2
n8:hasPublisher
Springer-Verlag
n13:isbn
9783642102165
n7:organizacniJednotka
14330