scientific article; zbMATH DE number 432771

MaRDI QIDQ3138901zbMATH OpenFDO

Authors Elias Dahlhaus, Mark B. Nivick, Marek Karpinski

Publication date 2 January 1994

zbMATH Keywords

optimizationparallel algorithmsclique separator decompositionNC algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(4)

• An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
• Minimal triangulations of graphs: a survey
• An introduction to clique minimal separator decomposition
• Revisiting decomposition by clique separators

This page was built for publication:

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