Recognizing \(i\)-triangulated graphs in \(O(mn)\) time

DOI10.1016/S0020-0190(00)00138-1zbMath1339.05402OpenAlexW1491628531MaRDI QIDQ294870

Irena Rusu, F. Roussel

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000001381?np=y

zbMATH Keywords

graph algorithmsbreadth-first searchrecognition algorithm\(i\)-triangulated graph

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Classes of perfect graphs

Cites Work

• Algorithmic Aspects of Vertex Elimination on Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item