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
n18http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n19http://localhost/temp/predkladatel/
n14http://purl.org/net/nknouf/ns/bibtex#
n22http://linked.opendata.cz/resource/domain/vavai/projekt/
n20http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n17http://linked.opendata.cz/ontology/domain/vavai/
n10http://linked.opendata.cz/resource/domain/vavai/zamer/
n3https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://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#
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F08%3A00206131%21RIV10-MSM-11320___/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F08%3A00206131%21RIV10-MSM-11320___
rdf:type
skos:Concept n17:Vysledek
dcterms:description
In the paper we have presented a polynomial-time algorithm that decides existence of a locally injective or surjective homomorphism of two universal covers of graphs. These covers are encoded by finite degree matrices. In the paper we have presented a polynomial-time algorithm that decides existence of a locally injective or surjective homomorphism of two universal covers of graphs. These covers are encoded by finite degree matrices.
dcterms:title
Comparing universal covers in polynomial time Comparing universal covers in polynomial time
skos:prefLabel
Comparing universal covers in polynomial time Comparing universal covers in polynomial time
skos:notation
RIV/00216208:11320/08:00206131!RIV10-MSM-11320___
n4:aktivita
n8:Z n8:P
n4:aktivity
P(1M0545), Z(MSM0021620838)
n4:dodaniDat
n9:2010
n4:domaciTvurceVysledku
n20:4260686
n4:druhVysledku
n16:D
n4:duvernostUdaju
n11:S
n4:entitaPredkladatele
n13:predkladatel
n4:idSjednocenehoVysledku
360532
n4:idVysledku
RIV/00216208:11320/08:00206131
n4:jazykVysledku
n15:eng
n4:klicovaSlova
Comparing; universal; covers; polynomial; time
n4:klicoveSlovo
n7:covers n7:time n7:Comparing n7:polynomial n7:universal
n4:kontrolniKodProRIV
[57FF5792664B]
n4:mistoKonaniAkce
Berlin
n4:mistoVydani
Berlin
n4:nazevZdroje
Computer Science - Theory and Applications
n4:obor
n21:BA
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
2
n4:projekt
n22:1M0545
n4:rokUplatneniVysledku
n9:2008
n4:tvurceVysledku
Fiala, Jiří Paulusma, Daniel
n4:typAkce
n18:WRD
n4:wos
000256351100018
n4:zahajeniAkce
2008-01-01+01:00
n4:zamer
n10:MSM0021620838
s:numberOfPages
10
n14:hasPublisher
Springer-Verlag
n3:isbn
978-3-540-79708-1
n19:organizacniJednotka
11320