Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
arbitrary graphs
|
| gptkbp:complexity |
NP-complete problem
|
| gptkbp:field |
computer science
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Fischer–Meyer algorithm
|
| gptkbp:namedAfter |
gptkb:Michael_J._Fischer
Albert L. Meyer |
| gptkbp:publicationYear |
1971
|
| gptkbp:publishedIn |
gptkb:Communications_of_the_ACM
|
| gptkbp:solvedBy |
gptkb:maximum_clique_problem
|
| gptkbp:bfsParent |
gptkb:Michael_J._Fischer
|
| gptkbp:bfsLayer |
6
|