35 search results - page 1 / 7 » Fast discovery of connection subgraphs |
KDD
2004
ACM
14 years 11 months ago
2004
ACM
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
ASUNAM
2010
IEEE
14 years 12 days ago
2010
IEEE
Abstract--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...
ICDM
2009
IEEE
13 years 8 months ago
2009
IEEE
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
KDD
2007
ACM
14 years 11 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
WABI
2001
Springer
14 years 3 months ago
2001
Springer
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...