Related Experiment Video
Updated: Jun 8, 2026

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
Published on: January 16, 2019
ODES: an overlapping dense sub-graph algorithm
1International Arctic Research Center and Department of Computer Science, University of Alaska-Fairbanks, AK 99775, USA. jlong@alaska.edu
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
Related Concept Videos
Vector Algebra: Graphical Method
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
Graphical Representation of Inequalities
Graphs of Two-Variable Functions
Graphs of Functions
Extended Versions of Green’s Theorem
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...