Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph.
Maxim A. BabenkoTimofey A. UrbanovichPublished in: Probl. Inf. Transm. (2011)
Keyphrases
- dynamic programming
- preprocessing
- np hard
- detection algorithm
- graph based algorithm
- k means
- linear complexity
- computational complexity
- worst case
- graph structure
- selection algorithm
- random walk
- graph construction
- minimum weight
- weighted graph
- matching algorithm
- structured data
- clustering method
- expectation maximization
- learning algorithm
- maximum weight
- similarity graph
- maximum clique
- random graphs
- minimum spanning tree
- undirected graph
- closed form
- search space
- objective function
- similarity measure