Recognizing i-triangulated graphs in O(mn) time
We use breadth-first search and contractions of subgraphs to give a new and faster algorithm to recognize i-triangulated graphs. (C) 2000 Elsevier Science B.V. All rights reserved.
i-triangulated graph breadth-first search algorithms recognition algorithm