688 search results - page 40 / 138 » General Partitioning on Random Graphs |
SIGMETRICS
2004
ACM
15 years 5 months ago
2004
ACM
Balancing peer-to-peer graphs, including zone-size distributions, has recently become an important topic of peer-topeer (P2P) research [1], [2], [6], [19], [31], [36]. To bring an...
120
click to vote
AUSAI
2003
Springer
15 years 5 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...
85
Voted
SIAMDM
2008
15 years 10 days ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
CORR
2011
Springer
14 years 7 months ago
2011
Springer
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
119
click to vote
ICDM
2010
IEEE
14 years 10 months ago
2010
IEEE
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...