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

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

Namespace Prefixes

PrefixIRI
n14http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n12http://localhost/temp/predkladatel/
n11http://purl.org/net/nknouf/ns/bibtex#
n21http://linked.opendata.cz/resource/domain/vavai/projekt/
n7http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n23http://linked.opendata.cz/ontology/domain/vavai/
n10https://schema.org/
n17http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F14%3A10288454%21RIV15-MSM-11320___/
shttp://schema.org/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
rdfshttp://www.w3.org/2000/01/rdf-schema#
skoshttp://www.w3.org/2004/02/skos/core#
n15http://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/ontology/domain/vavai/riv/klicoveSlovo/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n16http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F14%3A10288454%21RIV15-MSM-11320___
rdf:type
n23:Vysledek skos:Concept
rdfs:seeAlso
http://link.springer.com/chapter/10.1007%2F978-3-319-13075-0_32
dcterms:description
Interval graphs are intersection graphs of closed intervals. A generalization of recognition called partial representation extension was introduced recently. The input gives an interval graph with a partial representation specifying some pre-drawn intervals. We ask whether the remaining intervals can be added to create an extending representation. In this paper, we characterize the minimal obstructions which make a partial representation non-extendible. This generalizes Lekkerkerker and Boland's characterization of minimal forbidden induced subgraphs of interval graphs. Each minimal obstruction consists of a forbidden induced subgraph together with at most four pre-drawn intervals. A Helly-type result follows: A partial representation is extendible if and only if every quadruple of pre-drawn intervals is extendible by itself. Our characterization leads to the first polynomial-time certifying algorithm for partial representation extension of intersection graphs. Interval graphs are intersection graphs of closed intervals. A generalization of recognition called partial representation extension was introduced recently. The input gives an interval graph with a partial representation specifying some pre-drawn intervals. We ask whether the remaining intervals can be added to create an extending representation. In this paper, we characterize the minimal obstructions which make a partial representation non-extendible. This generalizes Lekkerkerker and Boland's characterization of minimal forbidden induced subgraphs of interval graphs. Each minimal obstruction consists of a forbidden induced subgraph together with at most four pre-drawn intervals. A Helly-type result follows: A partial representation is extendible if and only if every quadruple of pre-drawn intervals is extendible by itself. Our characterization leads to the first polynomial-time certifying algorithm for partial representation extension of intersection graphs.
dcterms:title
Minimal Obstructions for Partial Representations of Interval Graphs Minimal Obstructions for Partial Representations of Interval Graphs
skos:prefLabel
Minimal Obstructions for Partial Representations of Interval Graphs Minimal Obstructions for Partial Representations of Interval Graphs
skos:notation
RIV/00216208:11320/14:10288454!RIV15-MSM-11320___
n4:aktivita
n5:S n5:P
n4:aktivity
P(GBP202/12/G061), S
n4:dodaniDat
n16:2015
n4:domaciTvurceVysledku
n7:5775485
n4:druhVysledku
n19:D
n4:duvernostUdaju
n8:S
n4:entitaPredkladatele
n17:predkladatel
n4:idSjednocenehoVysledku
29461
n4:idVysledku
RIV/00216208:11320/14:10288454
n4:jazykVysledku
n18:eng
n4:klicovaSlova
minimal obstruction; partial representation; interval graph
n4:klicoveSlovo
n20:minimal%20obstruction n20:interval%20graph n20:partial%20representation
n4:kontrolniKodProRIV
[EBA7E2ED7F1F]
n4:mistoKonaniAkce
Jeonju, South Korea
n4:mistoVydani
Switzerland
n4:nazevZdroje
Algorithms and Computation
n4:obor
n22:IN
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
2
n4:projekt
n21:GBP202%2F12%2FG061
n4:rokUplatneniVysledku
n16:2014
n4:tvurceVysledku
Klavík, Pavel Saumell, Maria
n4:typAkce
n14:WRD
n4:zahajeniAkce
2014-12-15+01:00
s:issn
0302-9743
s:numberOfPages
13
n15:doi
10.1007/978-3-319-13075-0_32
n11:hasPublisher
Springer International Publishing
n10:isbn
978-3-319-13074-3
n12:organizacniJednotka
11320