Sciweavers

68 search results - page 1 / 14
» Subgraph Support in a Single Large Graph
Sort
View
ICDM
2007
IEEE
118views Data Mining» more  ICDM 2007»
14 years 5 months ago
Subgraph Support in a Single Large Graph
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
Mathias Fiedler, Christian Borgelt
MLG
2007
Springer
14 years 5 months ago
Support Computation for Mining Frequent Subgraphs in a Single Graph
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
Mathias Fiedler, Christian Borgelt
SSDBM
2010
IEEE
185views Database» more  SSDBM 2010»
13 years 9 months ago
DESSIN: Mining Dense Subgraph Patterns in a Single Graph
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
Shirong Li, Shijie Zhang, Jiong Yang
VLDB
2005
ACM
177views Database» more  VLDB 2005»
14 years 4 months ago
Discovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
David Gibson, Ravi Kumar, Andrew Tomkins
JCT
2011
86views more  JCT 2011»
13 years 5 months ago
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
The circumference of a graph is the length of its longest cycles. Results of Jackson, and Jackson and Wormald, imply that the circumference of a 3-connected cubic n-vertex graph i...
Mark Bilinski, Bill Jackson, Jie Ma, Xingxing Yu