17th Annual European Symposium on Algorithms (ESA) : 7–9 September 2009 : IT University of Copenhage
An $L(2,1)$-labeling of a graph is a labeling of its vertices by nonnegative integers, such that the...
The L(2, 1)-labeling problem consists of assigning colors from the integer set 0 ...., lambda to the...
AbstractThe LCS of two rooted, ordered, and labeled trees F and G is the largest forest that can be ...
Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, Ju...
AbstractAn L(2,1)-labeling of a graph G is an assignment f from the vertex set V(G) to the set of no...
Theme 2 - Genie logiciel et calcul symbolique - Projet EurecaSIGLEAvailable at INIST (FR), Document ...
this paper we present a linear time algorithm for a tree mapping measure. This improvement makes the...
An L(2,1)-labeling of a graph is a mapping from its vertex set into nonnegative integers such that t...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : RP 10530 / INIST-CNRS - ...
AbstractAn L(2,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of...
We present a linear algorithm which generates randomly and with uniform probability many kinds of tr...
The problem of coding labeled trees has been widely studied in the literature and several bijective ...
The problem of coding labeled trees has been widely studied in the literature and several bijective ...
$L(2,1)$-labeling is a graph coloring model inspired by a frequency assignment in telecommunication....
An L(2,1)-labeling for a graph G consists of assigning non- negative integers, 0s, to the nodes of G...
An $L(2,1)$-labeling of a graph is a labeling of its vertices by nonnegative integers, such that the...
The L(2, 1)-labeling problem consists of assigning colors from the integer set 0 ...., lambda to the...
AbstractThe LCS of two rooted, ordered, and labeled trees F and G is the largest forest that can be ...
Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, Ju...
AbstractAn L(2,1)-labeling of a graph G is an assignment f from the vertex set V(G) to the set of no...
Theme 2 - Genie logiciel et calcul symbolique - Projet EurecaSIGLEAvailable at INIST (FR), Document ...
this paper we present a linear time algorithm for a tree mapping measure. This improvement makes the...
An L(2,1)-labeling of a graph is a mapping from its vertex set into nonnegative integers such that t...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : RP 10530 / INIST-CNRS - ...
AbstractAn L(2,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of...
We present a linear algorithm which generates randomly and with uniform probability many kinds of tr...
The problem of coding labeled trees has been widely studied in the literature and several bijective ...
The problem of coding labeled trees has been widely studied in the literature and several bijective ...
$L(2,1)$-labeling is a graph coloring model inspired by a frequency assignment in telecommunication....
An L(2,1)-labeling for a graph G consists of assigning non- negative integers, 0s, to the nodes of G...
An $L(2,1)$-labeling of a graph is a labeling of its vertices by nonnegative integers, such that the...
The L(2, 1)-labeling problem consists of assigning colors from the integer set 0 ...., lambda to the...
AbstractThe LCS of two rooted, ordered, and labeled trees F and G is the largest forest that can be ...
DOI
Add to ORKG