1591 search results - page 216 / 319 » Random lifts of graphs |
152
click to vote
ASUNAM
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
163
click to vote
MASCOTS
2003
15 years 7 months ago
2003
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...
146
click to vote
ACTAC
2007
15 years 6 months ago
2007
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...
122
click to vote
CACM
2008
15 years 6 months ago
2008
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
180
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
One property of networks that has received comparatively little attention is hierarchy, i.e., the property of having vertices that cluster together in groups, which then join to f...