Sciweavers

863 search results - page 74 / 173
» Links in edge-colored graphs
Sort
View
WCC
2005
Springer
156views Cryptology» more  WCC 2005»
14 years 2 months ago
One and Two-Variable Interlace Polynomials: A Spectral Interpretation
We relate the one- and two-variable interlace polynomials of a graph to the spectra of a quadratic boolean function with respect to a strategic subset of local unitary transforms. ...
Constanza Riera, Matthew G. Parker
WEBI
2001
Springer
14 years 1 months ago
Average-Clicks: A New Measure of Distance on the World Wide Web
The pages and hyperlinks of the World Wide Web may be viewed as nodes and edges in a directed graph. In this paper, we propose a new definition of the distance between two pages, ...
Yutaka Matsuo, Yukio Ohsawa, Mitsuru Ishizuka
ESANN
2003
13 years 10 months ago
Robust Topology Representing Networks
Martinetz and Schulten proposed the use of a Competitive Hebbian Learning (CHL) rule to build Topology Representing Networks. From a set of units and a data distribution, a link i...
Michaël Aupetit
TPDS
2010
98views more  TPDS 2010»
13 years 7 months ago
Minimum Latency Gossiping in Radio Networks
—We studied the minimum latency gossiping (all-to-all broadcast) problem in multihop radio networks defined as follows: Each node in the network is preloaded with a message and t...
Scott C.-H. Huang, Peng-Jun Wan, Hongwei Du, E. K....
IM
2008
13 years 9 months ago
Directed Random Dot Product Graphs
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...
Stephen J. Young, Edward R. Scheinerman