About: L(2,1,1)-Labeling Is NP-Complete for Trees     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
  • An L(p(1), p(2), p(3))-labeling of a graph G with span lambda is a mapping f that assigns each vertex u of G an integer label 0 {= f(u) {= lambda such that vertical bar f(u) - f(v)vertical bar }= p(i) whenever vertices u and v are of distance i for i is an element of {1, 2, 3}. We show that testing whether a given graph has an L(2, 1, 1)-labeling with some given span lambda is NP-complete even for the class of trees.
  • An L(p(1), p(2), p(3))-labeling of a graph G with span lambda is a mapping f that assigns each vertex u of G an integer label 0 {= f(u) {= lambda such that vertical bar f(u) - f(v)vertical bar }= p(i) whenever vertices u and v are of distance i for i is an element of {1, 2, 3}. We show that testing whether a given graph has an L(2, 1, 1)-labeling with some given span lambda is NP-complete even for the class of trees. (en)
Title
  • L(2,1,1)-Labeling Is NP-Complete for Trees
  • L(2,1,1)-Labeling Is NP-Complete for Trees (en)
skos:prefLabel
  • L(2,1,1)-Labeling Is NP-Complete for Trees
  • L(2,1,1)-Labeling Is NP-Complete for Trees (en)
skos:notation
  • RIV/00216208:11320/10:10051725!RIV11-MSM-11320___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • S, 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
  • 269082
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/10:10051725
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • TREEWIDTH; GRAPHS; DISTANCE CONSTRAINED LABELINGS (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [A4E83ECD3776]
http://linked.open...v/mistoKonaniAkce
  • Praha
http://linked.open...i/riv/mistoVydani
  • Berlin
http://linked.open...i/riv/nazevZdroje
  • THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Lidický, Bernard
  • Paulusma, Daniël
  • Golovach, Petr A
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000279560400019
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
issn
  • 0302-9743
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
https://schema.org/isbn
  • 978-3-642-13561-3
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, 52 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software