An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs (Q1123622)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs |
scientific article; zbMATH DE number 4110120
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs |
scientific article; zbMATH DE number 4110120 |
Statements
An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs (English)
0 references
1989
0 references
maximum weight clique algorithm
0 references
maximum weight clique problem
0 references
maximum weight independent sets
0 references
bipartite graphs
0 references
0 references
