Carraghan–Pardalos algorithm
GPTKB entity
Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
undirected graphs
|
| gptkbp:complexity |
exponential time
|
| gptkbp:field |
computer science
operations research |
| gptkbp:introduced |
gptkb:Panos_Pardalos
gptkb:Richard_Carraghan |
| gptkbp:introducedIn |
1990
|
| gptkbp:notableFor |
simplicity
practical efficiency for sparse graphs |
| gptkbp:publishedIn |
gptkb:Discrete_Applied_Mathematics
|
| gptkbp:solvedBy |
gptkb:maximum_clique_problem
|
| gptkbp:type |
exact algorithm
|
| gptkbp:bfsParent |
gptkb:maximum_clique_problem
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Carraghan–Pardalos algorithm
|