Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem (Q4285462)
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 528964
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem |
scientific article; zbMATH DE number 528964 |
Statements
Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem (English)
0 references
13 July 1994
0 references
polynomial algorithm
0 references
edge-maximal triangulated subgraph
0 references
clique
0 references
0.8058698773384094
0 references
0.7999177575111389
0 references
0.7975713610649109
0 references
0.7935654520988464
0 references
0.7825596928596497
0 references
