Home » News » seminar » Yixin Cao gave an online talk on the algorithm for recognizing interval graphs with only four LexBFS searches at the Virtual Discrete Math Colloquium

Yixin Cao gave an online talk on the algorithm for recognizing interval graphs with only four LexBFS searches at the Virtual Discrete Math Colloquium

On March 17, 2021, at the Virtual Discrete Math Colloquium, Yixin Cao (操宜新) from Hong Kong Polytechnic University gave an online talk on the recognition algorithm for interval graphs by using 4 graph searchers with an improved presentation compared to the version of Li and Wu. The title of his talk was “Recognizing (unit) interval graphs by zigzag graph searches“.