AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs (Q4373007): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jagm.1997.0868 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982667852 / rank | |||
Normal rank | |||
Latest revision as of 20:14, 19 March 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
