About: On the complexity of reconstructing H-free graphs from their star systems     Goto   Sponge   NotDistinct   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
  • Ukažujeme, že problém rekonstrukce H-prostých grafů ze systémů okolí jejich vrcholů je polynomiálně řešitelný, pokud H je cesta nebo kružnice na nejvýše 4 vrcholech, a NP-úplný, pokud je to cesta nebo kružnice s alespoň 5 vrcholy. (cs)
  • We prove that when H is a path or a cycle on at most 4 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 5 vertices.
  • We prove that when H is a path or a cycle on at most 4 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 5 vertices. (en)
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 (en)
  • Výpočetní složitost rekonstrukce H-prostých grafů z jejich systémů okolí (cs)
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 (en)
  • Výpočetní složitost rekonstrukce H-prostých grafů z jejich systémů okolí (cs)
skos:notation
  • RIV/00216208:11320/08:00100662!RIV09-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
  • 384708
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/08:00100662
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • complexity; reconstructing; H-free; graphs; their; systems (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [377C918DE802]
http://linked.open...v/mistoKonaniAkce
  • Berlin
http://linked.open...i/riv/mistoVydani
  • Berlin
http://linked.open...i/riv/nazevZdroje
  • LATIN 2008: Theoretical Informatics
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
  • Kratochvíl, Jan
  • Lokshtanov, Daniel
  • Mancini, Federico
  • Telle, Jan Arne
  • Fomin, Fedor
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000254390900017
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-78772-3
http://localhost/t...ganizacniJednotka
  • 11320
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software