About: FO model checking; parameterized complexity; interval graph; clique-width     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
  • We study the computational complexity of the FO model checking problem on interval graphs, i.e., intersection graphs of intervals on the real line. The main positive result is that this problem can be solved in time O(n log n) for n-vertex interval graphs with representations containing only intervals with lengths from a prescribed finite set. We complement this result by showing that the same is not true if the lengths are restricted to any set that is dense in some open subset, e.g., in the set (1,1 + ?).
  • We study the computational complexity of the FO model checking problem on interval graphs, i.e., intersection graphs of intervals on the real line. The main positive result is that this problem can be solved in time O(n log n) for n-vertex interval graphs with representations containing only intervals with lengths from a prescribed finite set. We complement this result by showing that the same is not true if the lengths are restricted to any set that is dense in some open subset, e.g., in the set (1,1 + ?). (en)
Title
  • FO model checking; parameterized complexity; interval graph; clique-width
  • FO model checking; parameterized complexity; interval graph; clique-width (en)
skos:prefLabel
  • FO model checking; parameterized complexity; interval graph; clique-width
  • FO model checking; parameterized complexity; interval graph; clique-width (en)
skos:notation
  • RIV/49777513:23520/13:43919150!RIV14-GA0-23520___
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GAP202/11/0196)
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
  • 75379
http://linked.open...ai/riv/idVysledku
  • RIV/49777513:23520/13:43919150
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • clique-width; interval graph; parameterized complexity; FO model checking (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [D14DBF22234D]
http://linked.open...v/mistoKonaniAkce
  • Riga, Litva
http://linked.open...i/riv/mistoVydani
  • Heidelberg
http://linked.open...i/riv/nazevZdroje
  • Proceedings of 40th International Colloquium on Automata, Languages and Programming (ICALP 2013)
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
  • Ganian, Robert
  • Hliněný, Petr
  • Obdržálek, Jan
  • Teska, Jakub
  • Daniel, Král'
  • Schwartz, Jarett
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://bibframe.org/vocab/doi
  • 10.1007/978-3-642-39212-2_24
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
https://schema.org/isbn
  • 978-3-642-39211-5
http://localhost/t...ganizacniJednotka
  • 23520
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