Sciweavers

34 search results - page 1 / 7
» L(2, 1)-labelling of graphs
Sort
View
MFCS
2007
Springer
13 years 9 months ago
Exact Algorithms for L (2, 1)-Labeling of Graphs
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...
Jan Kratochvíl, Dieter Kratsch, Mathieu Lie...
SODA
2008
ACM
85views Algorithms» more  SODA 2008»
13 years 5 months ago
L(2, 1)-labelling of graphs
Frédéric Havet, Bruce A. Reed, Jean-...
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
13 years 8 months ago
A Linear Time Algorithm for L(2, 1)-Labeling of Trees
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yush...
DM
2008
65views more  DM 2008»
13 years 3 months ago
On the L(p, 1)-labelling of graphs
D. Gonçalves
CIKM
2009
Springer
13 years 10 months ago
L2 norm regularized feature kernel regression for graph data
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
Hongliang Fei, Jun Huan