Dense subgraph maintenance under streaming edge weight updates for real-time story identification
Proceedings of the VLDB Endowment
Reverse engineering molecular hypergraphs
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Reverse Engineering Molecular Hypergraphs
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 3.84 |
Summary: Enumeration of the dense sub-graphs of a graph is of interest in community discovery and membership problems, including dense sub-graphs that overlap each other. Described herein is ODES (Overlapping DEnse Sub-graphs), pthreads parallelized software to extract all overlapping maximal sub-graphs whose densities are greater than or equal to a specified cutoff density of at least 1/2. Availability and Implementation: http://dense.sf.net Contact: jlong@alaska.edu