Login / Signup
An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs.
Andrzej Ehrenfeucht
Harold N. Gabow
Ross M. McConnell
Stephen J. Sullivan
Published in:
J. Algorithms (1994)
Keyphrases
</>
tree decomposition
dynamic programming
cost function
decomposition method
tree width
np hard
worst case
decomposition methods
constraint networks
graph theory
particle swarm optimization
search space
computational complexity
objective function
simulated annealing
machine learning
support vector machine