Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

95

Voted

PKDD
2007
Springer

124views Data Mining» more PKDD 2007»

The Most Reliable Subgraph Problem

15 years 9 months ago

The Most Reliable Subgraph Problem

Download www.cs.helsinki.fi

Petteri Hintsanen

Real-time Traffic

PKDD 2007 |

claim paper

Related Content

» Fast Discovery of Reliable Subnetworks

» On Algorithm for AllPairs Most Reliable Quickest Paths

» Most Reliable Routing in WDM Mesh Networks with Arbitrary Risk Distribution

» Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems

» Efficient Discovery of Frequent Correlated Subgraph Pairs

» Covering Graphs with Few Complete Bipartite Subgraphs

» High Performance Subgraph Mining in Molecular Compounds

» Graph Summaries for Subgraph Frequency Estimation

» Lower bounds for twoperiod grooming via linear programming duality

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	PKDD
Authors	Petteri Hintsanen

Comments (0)