Recognizing i-triangulated graphs in O(mn) time

DOI10.1016/S0020-0190(00)00138-1MaRDI QIDQ294870zbMATH OpenOpenAlexFDO

Authors F. Roussel, Irena Rusu

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

breadth-first searchgraph algorithms\(i\)-triangulated graphrecognition algorithm

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3878985 (Why is no real title available?)
• scientific article; zbMATH DE number 3908479 (Why is no real title available?)
• scientific article; zbMATH DE number 3214398 (Why is no real title available?)
• Algorithmic Aspects of Vertex Elimination on Graphs

Cited in

(1)

• Classes of perfect graphs

This page was built for publication: Recognizing \(i\)-triangulated graphs in \(O(mn)\) time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294870)