This HTML5 document contains 47 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/
n5http://localhost/temp/predkladatel/
n9http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8http://linked.opendata.cz/resource/domain/vavai/projekt/
n13http://linked.opendata.cz/resource/domain/vavai/subjekt/
n4http://linked.opendata.cz/ontology/domain/vavai/
n16http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
rdfshttp://www.w3.org/2000/01/rdf-schema#
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n20http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F11%3A10103380%21RIV12-MSM-11320___/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n22http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F11%3A10103380%21RIV12-MSM-11320___
rdf:type
n4:Vysledek skos:Concept
rdfs:seeAlso
http://dx.doi.org/10.1002/jgt.20544
dcterms:description
We study the computational complexity of the H-free Star System problem. We prove that when H is a path or a cycle on at most four vertices the problem is polynomial time solvable. In complement to this result, we show that if H belongs to a certain large class of graphs the H-free Star System problem is NP-complete. In particular, the problem is NP-complete when H is either a cycle or a path on at least five vertices. This yields a complete dichotomy for paths and cycles. We study the computational complexity of the H-free Star System problem. We prove that when H is a path or a cycle on at most four vertices the problem is polynomial time solvable. In complement to this result, we show that if H belongs to a certain large class of graphs the H-free Star System problem is NP-complete. In particular, the problem is NP-complete when H is either a cycle or a path on at least five vertices. This yields a complete dichotomy for paths and cycles.
dcterms:title
On the Complexity of Reconstructing H-Free Graphs from Their Star Systems On the Complexity of Reconstructing H-Free Graphs from Their Star Systems
skos:prefLabel
On the Complexity of Reconstructing H-Free Graphs from Their Star Systems On the Complexity of Reconstructing H-Free Graphs from Their Star Systems
skos:notation
RIV/00216208:11320/11:10103380!RIV12-MSM-11320___
n4:predkladatel
n13:orjk%3A11320
n3:aktivita
n12:Z n12:P
n3:aktivity
P(1M0545), Z(MSM0021620838)
n3:cisloPeriodika
2
n3:dodaniDat
n22:2012
n3:domaciTvurceVysledku
n9:1123580
n3:druhVysledku
n18:J
n3:duvernostUdaju
n11:S
n3:entitaPredkladatele
n7:predkladatel
n3:idSjednocenehoVysledku
218182
n3:idVysledku
RIV/00216208:11320/11:10103380
n3:jazykVysledku
n17:eng
n3:klicovaSlova
Graph; Reconstruction; Complexity
n3:klicoveSlovo
n14:Complexity n14:Graph n14:Reconstruction
n3:kodStatuVydavatele
US - Spojené státy americké
n3:kontrolniKodProRIV
[FD64CCB69A4C]
n3:nazevZdroje
Journal of Graph Theory
n3:obor
n21:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
5
n3:projekt
n8:1M0545
n3:rokUplatneniVysledku
n22:2011
n3:svazekPeriodika
68
n3:tvurceVysledku
Fomin, Fedor V. Telle, Jan Arne Kratochvíl, Jan Lokshtanov, Daniel Mancini, Federico
n3:wos
000294818900003
n3:zamer
n16:MSM0021620838
s:issn
0364-9024
s:numberOfPages
12
n20:doi
10.1002/jgt.20544
n5:organizacniJednotka
11320