216 search results - page 1 / 44 » Exact Algorithms for L (2, 1)-Labeling of Graphs |
MFCS
2007
Springer
13 years 11 months ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
ESA
2009
Springer
13 years 9 months ago
2009
Springer
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
WEA
2010
Springer
13 years 12 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...