Loading...
Please wait, while we are loading the content...
Similar Documents
An Eecient Algorithm for the Minimum Clique Partition Problem
| Content Provider | Semantic Scholar |
|---|---|
| Author | Plotnikov, Anatoly D. |
| Copyright Year | 2000 |
| Abstract | We design an algorithm for an exact solution of the Minimum Clique Partition Problem. For an arbitrary undirected graph G, we use a technique for nite partially ordered sets, in particular, a partition of such sets into the minimum number of paths. The running time of the algorithm is equal to O(n 6), where n is the number of graph vertices. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.busygin.dp.ua/clipat.ps.gz |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |