Arboricity and bipartite subgraph listing algorithms

David Eppstein
Information Processing Letters 51(4):207–211, Aug 1994
Tech. report 94-11, Univ. of California, Irvine, Dept. of Information and Computer Science, 1994
Mathematical Reviews 95j:05157
http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-94-11.pdf
http://dx.doi.org/10.1016/0020-0190(94)90121-X

Cited by:

• Theoretical foundations of association rules
• Scalable algorithms for association mining
• On maximal frequent and minimal infrequent sets in binary matrices
• Consensus algorithms for the generation of all maximal bicliques
• Scalable Data Mining for Rules