3105 search results - page 399 / 621 » The Path-Packing Structure of Graphs |
137
click to vote
ACMSE
2006
ACM
15 years 10 months ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
150
click to vote
ASPDAC
2006
ACM
15 years 10 months ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
128
click to vote
IWCMC
2006
ACM
15 years 10 months ago
2006
ACM
Self-Organized Networks (SONs) are a general description of autonomous networks without infrastructure, of which Ad Hoc, Sensor and Mesh networks are special cases. We had previou...
145
click to vote
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
112
click to vote
BIRTHDAY
2005
Springer
15 years 9 months ago
2005
Springer
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...