1162 search results - page 10 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
135
Voted
DATE
2006
IEEE
15 years 7 months ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
104
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— We study averaging algorithms, when implemented in large networks of wirelessly connected elements. We extend the notion of “Increasing Correctness” (IC) which was ...
116
Voted
JPDC
2006
15 years 3 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
177
Voted
SDM
2004
SIAM
15 years 5 months ago
2004
SIAM
Microarray experiments have been extensively used for simultaneously measuring DNA expression levels of thousands of genes in genome research. A key step in the analysis of gene e...
122
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...