34 search results - page 7 / 7 » L(2, 1)-labelling of graphs |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
EJC
2007
13 years 4 months ago
2007
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
EUSAI
2004
Springer
13 years 10 months ago
2004
Springer
With the rapid growth of emerging demand and deployment of wireless LAN (WLAN), much of traffic including multimedia traffic is forced to travel over WLAN. Since the legacy IEEE 80...
CIKM
2006
Springer
13 years 8 months ago
2006
Springer
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...