463 search results - page 31 / 93 » The Most Reliable Subgraph Problem |
116
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
129
Voted
ICDM
2006
IEEE
15 years 8 months ago
2006
IEEE
Mining graph data is an increasingly popular challenge, which has practical applications in many areas, including molecular substructure discovery, web link analysis, fraud detect...
113
click to vote
GD
2004
Springer
15 years 8 months ago
2004
Springer
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
99
Voted
WG
2000
Springer
15 years 6 months ago
2000
Springer
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
108
click to vote
DM
2007
15 years 2 months ago
2007
Given a set P of at most 2n − 4 prescribed edges (n ≥ 5) and vertices u and v whose mutual distance is odd, the n-dimensional hypercube Qn contains a hamiltonian path between ...