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
rdfs:seeAlso
Description
  • We study the computational complexity of the H-free Star System problem. We prove that when H is a path or a cycle on at most four 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 five vertices. This yields a complete dichotomy for paths and cycles.
  • We study the computational complexity of the H-free Star System problem. We prove that when H is a path or a cycle on at most four 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 five vertices. This yields a complete dichotomy for paths and cycles. (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)
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)
skos:notation
  • RIV/00216208:11320/11:10103380!RIV12-MSM-11320___
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), Z(MSM0021620838)
http://linked.open...iv/cisloPeriodika
  • 2
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
  • 218182
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/11:10103380
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Graph; Reconstruction; Complexity (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • US - Spojené státy americké
http://linked.open...ontrolniKodProRIV
  • [FD64CCB69A4C]
http://linked.open...i/riv/nazevZdroje
  • Journal of Graph Theory
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...v/svazekPeriodika
  • 68
http://linked.open...iv/tvurceVysledku
  • Fomin, Fedor V.
  • Kratochvíl, Jan
  • Lokshtanov, Daniel
  • Mancini, Federico
  • Telle, Jan Arne
http://linked.open...ain/vavai/riv/wos
  • 000294818900003
http://linked.open...n/vavai/riv/zamer
issn
  • 0364-9024
number of pages
http://bibframe.org/vocab/doi
  • 10.1002/jgt.20544
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, 39 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software