1542 search results - page 168 / 309 » The metamathematics of random graphs |
127
Voted
COMBINATORICS
2000
15 years 1 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
129
click to vote
KDD
2008
ACM
16 years 2 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
120
click to vote
GLOBECOM
2007
IEEE
15 years 8 months ago
2007
IEEE
—In this paper, we clarify inter-link interference in wireless ad-hoc networks by using link-directional interference graphs (l-graph). Most of the interference graphs in the lit...
108
Voted
GD
2004
Springer
15 years 7 months ago
2004
Springer
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
133
Voted
AUSAI
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...