977 search results - page 15 / 196 » Permuting Web Graphs |
TCS
2002
14 years 11 months ago
2002
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such th...
100
click to vote
IV
2010
IEEE
14 years 10 months ago
2010
IEEE
We propose an interactive framework for the 3D visualization of the time-series of Web graphs. The purpose of our framework is to enable users to examine the evolution of Web grap...
113
click to vote
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
We propose a new crossover that generalizes cycle crossover to permutations with repetitions and naturally suits partition problems. We tested it on graph partitioning problems ob...
103
Voted
JCT
2008
14 years 11 months ago
2008
A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all t...