Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
URI: https://gptkb.org/entity/Shortest_Paths_Revisited,_NP-Complete_Problems_and_What_To_Do_About_Them
GPTKB entity
Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:academic_journal
|
| gptkbp:author |
gptkb:Richard_M._Karp
|
| gptkbp:citation |
highly cited
|
| https://www.w3.org/2000/01/rdf-schema#label |
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
|
| gptkbp:influenced |
theoretical computer science
|
| gptkbp:language |
English
|
| gptkbp:publicationYear |
1972
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_6th_Annual_ACM_Symposium_on_Theory_of_Computing
|
| gptkbp:topic |
gptkb:NP-completeness
gptkb:shortest_path_problem computational complexity |
| gptkbp:bfsParent |
gptkb:Algorithms_Specialization_(Coursera)
|
| gptkbp:bfsLayer |
7
|