AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs (Q4373007): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:57, 7 February 2024
scientific article; zbMATH DE number 1098605
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs |
scientific article; zbMATH DE number 1098605 |
Statements
AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs (English)
0 references
25 May 1998
0 references
circular-arc graphs
0 references
