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

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

Namespace Prefixes

PrefixIRI
n12http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n13http://purl.org/net/nknouf/ns/bibtex#
n20http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n9http://linked.opendata.cz/resource/domain/vavai/projekt/
n3http://linked.opendata.cz/ontology/domain/vavai/
n6http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F05%3A00027504%21RIV06-AV0-67985840/
n19https://schema.org/
n11http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F05%3A00027504%21RIV06-AV0-67985840
rdf:type
n3:Vysledek skos:Concept
dcterms:description
Článek navrhuje dva algoritmy pro listové dělení matic. List matrix partitions are restricted binary list constraint satisfaction problems which generalize list homomorphisms and many graph partition problems arising, e.g., in the study of perfect graphs. Most of the existing algorithms apply to concrete small matrices, i.e., to partitions into a small number of parts. We focus on two general classes of partition problems, provide algorithms for their solution, and discuss their implications. List matrix partitions are restricted binary list constraint satisfaction problems which generalize list homomorphisms and many graph partition problems arising, e.g., in the study of perfect graphs. Most of the existing algorithms apply to concrete small matrices, i.e., to partitions into a small number of parts. We focus on two general classes of partition problems, provide algorithms for their solution, and discuss their implications.
dcterms:title
Two algorithms for general list matrix partitions Two algorithms for general list matrix partitions Dva algoritmy pro listové dělení matic
skos:prefLabel
Two algorithms for general list matrix partitions Two algorithms for general list matrix partitions Dva algoritmy pro listové dělení matic
skos:notation
RIV/67985840:_____/05:00027504!RIV06-AV0-67985840
n5:strany
870;876
n5:aktivita
n10:P n10:Z
n5:aktivity
P(IAA1019401), P(LN00A056), Z(AV0Z10190503), Z(MSM0021620838)
n5:dodaniDat
n15:2006
n5:domaciTvurceVysledku
n20:8679673
n5:druhVysledku
n16:D
n5:duvernostUdaju
n21:S
n5:entitaPredkladatele
n6:predkladatel
n5:idSjednocenehoVysledku
547483
n5:idVysledku
RIV/67985840:_____/05:00027504
n5:jazykVysledku
n17:eng
n5:klicovaSlova
combinatorics; graph coloring; homomorphism
n5:klicoveSlovo
n7:homomorphism n7:combinatorics n7:graph%20coloring
n5:kontrolniKodProRIV
[C57CE7968C76]
n5:mistoKonaniAkce
Vancouver
n5:mistoVydani
New York, Philadelphia
n5:nazevZdroje
Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
n5:obor
n18:BA
n5:pocetDomacichTvurcuVysledku
1
n5:pocetTvurcuVysledku
4
n5:projekt
n9:IAA1019401 n9:LN00A056
n5:rokUplatneniVysledku
n15:2005
n5:tvurceVysledku
Feder, T. Sgall, Jiří Hell, P. Král´, D.
n5:typAkce
n12:WRD
n5:zahajeniAkce
2005-01-23+01:00
n5:zamer
n11:MSM0021620838 n11:AV0Z10190503
s:numberOfPages
7
n13:hasPublisher
ACM, SIAM
n19:isbn
0-89871-585-7