An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset.
Shuji TsukiyamaIsao ShirakawaHiroshi OzakiHiromu AriyoshiPublished in: J. ACM (1980)
Keyphrases
- learning algorithm
- graph structure
- worst case
- preprocessing
- clustering method
- detection algorithm
- dominating set
- matching algorithm
- optimization algorithm
- computational complexity
- segmentation algorithm
- np hard
- graph partitioning
- graph based algorithm
- optimal solution
- graphical models
- dynamic programming
- knapsack problem
- weighted graph
- graph model
- minimum spanning tree
- graph construction
- maximum weight