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 the normal view instead:
scientific article; zbMATH DE number 4110120
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9265005588531494
0 references
0.923839032649994
0 references
0.8781368732452393
0 references
0.8666478395462036
0 references
