From a simple elimination ordering to a strong elimination ordering in linear time

DOI10.1016/S0020-0190(03)00228-XMaRDI QIDQ1007631zbMATH OpenFDO

Authors J. Martínez

Publication date 23 March 2009

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

Full work available at URL https://doi.org/10.1016/S0020-0190(03)00228-X

zbMATH Keywords

graph algorithmsgraph recognitionsimple elimination orderingstrong elimination orderingstrongly chordal graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Cites work

• Characterizations of strongly chordal graphs
• Construction of a simple elimination scheme for a chordal comparability graph in linear time
• Doubly lexical ordering of dense 0--1 matrices
• Doubly Lexical Orderings of Matrices
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 2086689 (Why is no real title available?)
• Three Partition Refinement Algorithms

Cited in

(1)

• Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs

This page was built for publication: From a simple elimination ordering to a strong elimination ordering in linear time

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