2304 search results - page 218 / 461 » On the Vulnerability of Large Graphs |
185
click to vote
WG
2005
Springer
16 years 2 days ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
224
Voted
EUROPAR
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
149
click to vote
DATE
2010
IEEE
15 years 11 months ago
2010
IEEE
— To overcome issues originating from the CMOS technology, a large-scale reconfigurable data-path (LSRDP) processor based on single-flux quantum circuits is introduced. LSRDP is ...
156
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
136
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...