About: Comparing universal covers in polynomial time     Goto   Sponge   Distinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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. (en)
Title
  • Comparing universal covers in polynomial time
  • Comparing universal covers in polynomial time (en)
skos:prefLabel
  • Comparing universal covers in polynomial time
  • Comparing universal covers in polynomial time (en)
skos:notation
  • RIV/00216208:11320/08:00206131!RIV10-MSM-11320___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), Z(MSM0021620838)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 360532
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/08:00206131
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Comparing; universal; covers; polynomial; time (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [57FF5792664B]
http://linked.open...v/mistoKonaniAkce
  • Berlin
http://linked.open...i/riv/mistoVydani
  • Berlin
http://linked.open...i/riv/nazevZdroje
  • Computer Science - Theory and Applications
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Fiala, Jiří
  • Paulusma, Daniel
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000256351100018
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
https://schema.org/isbn
  • 978-3-540-79708-1
http://localhost/t...ganizacniJednotka
  • 11320
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 84 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software