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

DOI10.1016/S0020-0190(03)00228-XzbMath1162.68811MaRDI QIDQ1007631

J. Martínez

Publication date: 23 March 2009

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

zbMATH Keywords

graph algorithmsstrongly chordal graphgraph recognitionsimple elimination orderingstrong elimination ordering

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Three Partition Refinement Algorithms

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