A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs.
Péter L. ErdösIstván MiklósZoltán ToroczkaiPublished in: Electron. J. Comb. (2010)
Keyphrases
- learning algorithm
- directed graph
- dynamic programming
- detection algorithm
- maximum flow
- computational cost
- high accuracy
- undirected graph
- cost function
- experimental evaluation
- significant improvement
- np hard
- computational complexity
- worst case
- simulated annealing
- matching algorithm
- graph structure
- convergence rate
- low degree
- clustering method
- optimization algorithm
- particle swarm optimization
- k means
- search space
- preprocessing
- image segmentation