A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph
From MaRDI portal
Publication:4124208
DOI10.1137/0205012zbMath0353.65018OpenAlexW2076455760MaRDI QIDQ4124208
Publication date: 1976
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0205012
Analysis of algorithms and problem complexity (68Q25) Graph theory (05C99) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Minimal triangulations of graphs: a survey, Minimal fill in O(\(n^{2.69}\)) time, Lex M versus MCS-M, Optimal decomposition by clique separators, On treewidth and minimum fill-in of asteroidal triple-free graphs, Approximating the bandwidth for asteroidal triple-free graphs, On minimal augmentation of a graph to obtain an interval graph, An \(O(n^2)\) time algorithm for the minimal permutation completion problem, A note on minimal d-separation trees for structural learning, Unnamed Item, An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem, Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs