TY -
T1 - Finding reliable subgraphs from large probabilistic graphs
SN - /
UR - http://hdl.handle.net/10138/143972
T3 -
A1 - Hintsanen, Petteri; Toivonen, Hannu
A2 -
PB -
Y1 - 2008
LA - eng
AB - Reliable subgraphs can be used, for example, to find and rank nontrivial links between given vertices, to concisely visualize large graphs, or to reduce the size of input for computationally demanding graph algorithms. We propose two new heuristics for solving the most reliable subgraph extraction problem on large, undirected probabilistic graphs. Such a problem is specified by a probabilistic graph G subject to random edge failures, a set of terminal vertices, and an integer K. The objective is...
VO -
IS -
SP -
OP -
KW - 113 Computer and information sciences
N1 -
PP -
ER -