Some aspects of the semi-perfect elimination

DOI10.1016/0166-218X(91)90056-3zbMath0754.05067OpenAlexW2049897762MaRDI QIDQ1175796

S. Singh

Publication date: 25 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(91)90056-3

zbMATH Keywords

chordal graphssemi-perfect elimination ordering

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (05C99) Ordered structures (06F99)

Related Items (2)

Chordal graphs and their clique graphs ⋮ LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem

Cites Work

• On rigid circuit graphs
• Some aspects of perfect elimination orderings in chordal graphs
• A note on superbrittle graphs
• Welsh-Powell opposition graphs
• Weak bipolarizable graphs
• On the semi-perfect elimination
• A characterisation of rigid circuit graphs
• Incidence matrices and interval graphs
• Triangulated graphs and the elimination process
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Scheduling Interval-Ordered Tasks
• Polynomially bounded algorithms for locatingp-centers on a tree
• Algorithmic Aspects of Vertex Elimination on Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Some aspects of the semi-perfect elimination