4865 search results - page 413 / 973 » The Complexity of Graph Connectivity |
185
click to vote
VLDB
2005
ACM
16 years 9 days ago
2005
ACM
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
243
click to vote
COMSWARE
2008
IEEE
15 years 8 months ago
2008
IEEE
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...
218
click to vote
ISPD
2012
ACM
14 years 2 months ago
2012
ACM
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
160
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
199
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...