6 search results - page 1 / 2 » On the L(p, 1)-labelling of graphs |
MFCS
2007
Springer
13 years 10 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
DM
2008
13 years 4 months ago
2008
PAKDD
1999
ACM
13 years 9 months ago
1999
ACM
CIKM
2011
Springer
12 years 4 months ago
2011
Springer
Extracting information from web pages is an important problem; it has several applications such as providing improved search results and construction of databases to serve user qu...