Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Lipton–Tarjan separator theorem | Statement: [Richard Lipton, knownFor, Lipton–Tarjan separator theorem]

Target entity: Lipton–Tarjan separator theorem
Context triple: [Richard Lipton, knownFor, Lipton–Tarjan separator theorem]

• A. 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.
• B. Graph Algorithms (book)
  "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.
• C. Furst–Saxe–Sipser lower bounds
  Furst–Saxe–Sipser lower bounds are foundational results in circuit complexity theory that established superpolynomial lower bounds for constant-depth Boolean circuits (AC⁰), demonstrating inherent limitations of such circuits for computing certain functions.
• D. Robert Tarjan
  Robert Tarjan is an American computer scientist renowned for his pioneering work in algorithms and data structures, including the development of efficient graph algorithms and the union–find data structure.
• E. Eppstein
  Eppstein is a small historic town in the German state of Hesse, known for its medieval castle and scenic location in the Taunus mountains.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Lipton–Tarjan separator theorem
Triple: [Richard Lipton, knownFor, Lipton–Tarjan separator theorem]

The Lipton–Tarjan separator theorem is a fundamental result in graph theory that shows any planar graph can be efficiently divided into roughly equal parts by removing only a relatively small set of vertices, enabling faster algorithms for many computational problems.

Target entity: Lipton–Tarjan separator theorem
Target entity description: The Lipton–Tarjan separator theorem is a fundamental result in graph theory that shows any planar graph can be efficiently divided into roughly equal parts by removing only a relatively small set of vertices, enabling faster algorithms for many computational problems.

• A. 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.
• B. Graph Algorithms (book)
  "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.
• C. Furst–Saxe–Sipser lower bounds
  Furst–Saxe–Sipser lower bounds are foundational results in circuit complexity theory that established superpolynomial lower bounds for constant-depth Boolean circuits (AC⁰), demonstrating inherent limitations of such circuits for computing certain functions.
• D. Robert Tarjan
  Robert Tarjan is an American computer scientist renowned for his pioneering work in algorithms and data structures, including the development of efficient graph algorithms and the union–find data structure.
• E. Eppstein
  Eppstein is a small historic town in the German state of Hesse, known for its medieval castle and scenic location in the Taunus mountains.
• F. None of above. chosen