Note | Clique seperator
Clique seperator Decomposition by clique seperator (Tarjan, 1985) Main Idea: Based on the idea of ‘divide and conquer’, this paper proposed an graph decomposition algorithm by finding the clique seperator recursively. The decomposition results in a binary decomposition tree. The author suggested some general ideas to tackle 4 NP-hard problems by ultlizing the binary decomposition tree. Preliminaries Perfect elimination ordering, Clique, Minimal and Minimum ordering, Seperator Algorithms Text description ...