Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings

DOI10.1137/070684355zbMath1219.05179OpenAlexW2090831585MaRDI QIDQ5189528

Geneviève Simonet, Anne Berry, R. Krueger

Publication date: 17 March 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070684355

zbMATH Keywords

triangulationgraph searchmeomaximal label searchpeo

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Graph extremities defined by search algorithms ⋮ An introduction to clique minimal separator decomposition ⋮ Computing a clique tree with the algorithm maximal label search ⋮ A general label search to investigate classical graph search algorithms ⋮ Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS ⋮ Unnamed Item ⋮ A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph ⋮ Bayesian networks: the minimal triangulations of a graph

This page was built for publication: Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings