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: Havel–Hakimi algorithm | Statement: [Erdős–Gallai theorem, relatedTo, Havel–Hakimi algorithm]

Target entity: Havel–Hakimi algorithm
Context triple: [Erdős–Gallai theorem, relatedTo, Havel–Hakimi algorithm]

• A. Erdős–Gallai theorem
  The Erdős–Gallai theorem is a fundamental result in graph theory that characterizes which sequences of nonnegative integers can occur as the degree sequences of simple graphs.
• B. Fleury's algorithm
  Fleury's algorithm is a classical graph-theoretic procedure for systematically finding an Eulerian trail by repeatedly choosing edges that are not bridges unless necessary.
• C. Hierholzer's algorithm
  Hierholzer's algorithm is a classical graph algorithm that efficiently constructs an Eulerian trail or circuit by iteratively building and merging cycles in a graph where such a trail exists.
• D. Cristian's algorithm
  Cristian's algorithm is a clock synchronization method in distributed systems that estimates accurate time on client machines by querying a time server and adjusting for message delays.
• E. Gallai theorem
  Gallai's theorem is a fundamental result in graph theory and Ramsey theory that characterizes the structure of colorings of complete graphs by guaranteeing large monochromatic or well-organized subgraphs.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Havel–Hakimi algorithm
Target entity description: The Havel–Hakimi algorithm is a procedure in graph theory used to determine whether a given degree sequence is graphical by iteratively reducing and checking the sequence.

• A. Erdős–Gallai theorem
  The Erdős–Gallai theorem is a fundamental result in graph theory that characterizes which sequences of nonnegative integers can occur as the degree sequences of simple graphs.
• B. Fleury's algorithm
  Fleury's algorithm is a classical graph-theoretic procedure for systematically finding an Eulerian trail by repeatedly choosing edges that are not bridges unless necessary.
• C. Hierholzer's algorithm
  Hierholzer's algorithm is a classical graph algorithm that efficiently constructs an Eulerian trail or circuit by iteratively building and merging cycles in a graph where such a trail exists.
• D. Cristian's algorithm
  Cristian's algorithm is a clock synchronization method in distributed systems that estimates accurate time on client machines by querying a time server and adjusting for message delays.
• E. Gallai theorem
  Gallai's theorem is a fundamental result in graph theory and Ramsey theory that characterizes the structure of colorings of complete graphs by guaranteeing large monochromatic or well-organized subgraphs.
• F. None of above. chosen