Fast Discovery of Reliable Subnetworks

We present a novel and efficient algorithm, Path Covering, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity between two given individuals in a social network. Formally, the given network is seen as a Bernoulli random graph Q, and the obj...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Hintsanen, P, Toivonen, H, Sevon, P
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Approximation algorithms Computer network reliability Computer science Construction industry Reliability theory Social network services
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!