All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

L(2,1,1)-Labeling Is NP-Complete for Trees

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10051725" target="_blank" >RIV/00216208:11320/10:10051725 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    L(2,1,1)-Labeling Is NP-Complete for Trees

  • Original language 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 isan 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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2010

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS

  • ISBN

    978-3-642-13561-3

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    11

  • Pages from-to

  • Publisher name

    Springer-Verlag

  • Place of publication

    Berlin

  • Event location

    Praha

  • Event date

    Jun 7, 2010

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000279560400019