Graph Algorithms (book)
E580628
"Graph Algorithms" is a foundational textbook by Shimon Even that systematically presents the theory, design, and analysis of algorithms for solving fundamental problems on graphs.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Graph Algorithms (book) canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T6258492 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Graph Algorithms (book) Context triple: [Shimon Even, notableWork, Graph Algorithms (book)]
-
A.
Introduction to Algorithms
Introduction to Algorithms is a widely used, comprehensive textbook on algorithms and data structures, renowned for its rigorous yet accessible coverage of theoretical and practical topics in computer science.
-
B.
Tarjan's strongly connected components algorithm
Tarjan's strongly connected components algorithm is a classic linear-time graph algorithm that efficiently identifies all strongly connected components in a directed graph using depth-first search and low-link values.
-
C.
Steiner tree problem
The Steiner tree problem is a classic optimization problem in combinatorial mathematics and computer science that seeks the shortest network of line segments connecting a given set of points, potentially adding extra intermediate points to minimize total length.
-
D.
P, NP, and NP-Completeness: The Basics of Complexity Theory
"P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
-
E.
Algorithms + Data Structures = Programs
"Algorithms + Data Structures = Programs" is a classic computer science textbook by Niklaus Wirth that systematically teaches how combining appropriate data structures with algorithms leads to effective and efficient programs.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Graph Algorithms (book) Target entity description: "Graph Algorithms" is a foundational textbook by Shimon Even that systematically presents the theory, design, and analysis of algorithms for solving fundamental problems on graphs.
-
A.
Introduction to Algorithms
Introduction to Algorithms is a widely used, comprehensive textbook on algorithms and data structures, renowned for its rigorous yet accessible coverage of theoretical and practical topics in computer science.
-
B.
Tarjan's strongly connected components algorithm
Tarjan's strongly connected components algorithm is a classic linear-time graph algorithm that efficiently identifies all strongly connected components in a directed graph using depth-first search and low-link values.
-
C.
Steiner tree problem
The Steiner tree problem is a classic optimization problem in combinatorial mathematics and computer science that seeks the shortest network of line segments connecting a given set of points, potentially adding extra intermediate points to minimize total length.
-
D.
P, NP, and NP-Completeness: The Basics of Complexity Theory
"P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
-
E.
Algorithms + Data Structures = Programs
"Algorithms + Data Structures = Programs" is a classic computer science textbook by Niklaus Wirth that systematically teaches how combining appropriate data structures with algorithms leads to effective and efficient programs.
- F. None of above. chosen
Statements (30)
| Predicate | Object |
|---|---|
| instanceOf |
book
ⓘ
textbook ⓘ |
| approach | systematic presentation of algorithms on graphs ⓘ |
| author | Shimon Even NERFINISHED ⓘ |
| basedOn | graph theory ⓘ |
| contribution | helped formalize the study of graph algorithms ⓘ |
| covers | fundamental problems on graphs ⓘ |
| emphasizes |
complexity analysis
ⓘ
formal correctness proofs ⓘ rigorous analysis of algorithms ⓘ |
| field |
algorithms
ⓘ
graph theory ⓘ |
| genre | computer science textbook ⓘ |
| hasReputation | foundational text in graph algorithms ⓘ |
| includes |
algorithms for connectivity
ⓘ
algorithms for matchings ⓘ algorithms for network flows ⓘ algorithms for shortest paths ⓘ algorithms for spanning trees ⓘ |
| intendedFor |
computer science students
ⓘ
practitioners using graph algorithms ⓘ researchers in algorithms ⓘ |
| language | English ⓘ |
| notableFor | clear and rigorous exposition of graph algorithms ⓘ |
| subject |
analysis of graph algorithms
ⓘ
design of graph algorithms ⓘ theory of graph algorithms ⓘ |
| topic | graph algorithms ⓘ |
| usedIn |
graduate courses on graph theory
ⓘ
university algorithms courses ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Graph Algorithms (book) Description of subject: "Graph Algorithms" is a foundational textbook by Shimon Even that systematically presents the theory, design, and analysis of algorithms for solving fundamental problems on graphs.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.