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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n15http://localhost/temp/predkladatel/
n12http://linked.opendata.cz/resource/domain/vavai/projekt/
n7http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n17http://linked.opendata.cz/ontology/domain/vavai/
n16http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n6http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F08%3A00024875%21RIV10-GA0-14330___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n11http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n13http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F08%3A00024875%21RIV10-GA0-14330___
rdf:type
skos:Concept n17:Vysledek
dcterms:description
We present a new algorithm that can output the rank-decomposition of width at most $k$ of a graph if such exists. For that we use an algorithm that, for an input matroid represented over a fixed finite field, outputs its branch-decomposition of width at most $k$ if such exists. This algorithm works also for partitioned matroids. Both these algorithms are fixed-parameter tractable, that is, they run in time $O(n^3)$ for each fixed value of $k$ where $n$ is the number of vertices / elements of the input. We present a new algorithm that can output the rank-decomposition of width at most $k$ of a graph if such exists. For that we use an algorithm that, for an input matroid represented over a fixed finite field, outputs its branch-decomposition of width at most $k$ if such exists. This algorithm works also for partitioned matroids. Both these algorithms are fixed-parameter tractable, that is, they run in time $O(n^3)$ for each fixed value of $k$ where $n$ is the number of vertices / elements of the input.
dcterms:title
Finding branch-decomposition and rank-decomposition Finding branch-decomposition and rank-decomposition
skos:prefLabel
Finding branch-decomposition and rank-decomposition Finding branch-decomposition and rank-decomposition
skos:notation
RIV/00216224:14330/08:00024875!RIV10-GA0-14330___
n3:aktivita
n8:S n8:P n8:Z
n3:aktivity
P(GA201/08/0308), S, Z(MSM0021622419)
n3:cisloPeriodika
3
n3:dodaniDat
n13:2010
n3:domaciTvurceVysledku
n7:7595646
n3:druhVysledku
n4:J
n3:duvernostUdaju
n19:S
n3:entitaPredkladatele
n6:predkladatel
n3:idSjednocenehoVysledku
368050
n3:idVysledku
RIV/00216224:14330/08:00024875
n3:jazykVysledku
n11:eng
n3:klicovaSlova
graph; matroid; rank-width; clique-width; branch-width; fixed parameter tractable algorithm
n3:klicoveSlovo
n5:clique-width n5:rank-width n5:matroid n5:fixed%20parameter%20tractable%20algorithm n5:graph n5:branch-width
n3:kodStatuVydavatele
US - Spojené státy americké
n3:kontrolniKodProRIV
[C3041CC3A400]
n3:nazevZdroje
SIAM Journal on Computing
n3:obor
n18:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:projekt
n12:GA201%2F08%2F0308
n3:rokUplatneniVysledku
n13:2008
n3:svazekPeriodika
38
n3:tvurceVysledku
Hliněný, Petr Oum, Sang-il
n3:wos
000258895100012
n3:zamer
n16:MSM0021622419
s:issn
0097-5397
s:numberOfPages
21
n15:organizacniJednotka
14330