Some aspects of the semi-perfect elimination

DOI10.1016/0166-218X(91)90056-3MaRDI QIDQ1175796zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On the semi-perfect elimination
• A note on perfect partial elimination
• scientific article; zbMATH DE number 421655
• Invariant aspects of elimination
• Some aspects of semirings
• Elimination schemes and lattices
• Partial elimination ideals and secant cones
• Elimination and fixed point iterations
• scientific article; zbMATH DE number 4027602
• Error Theory for Elimination by Aspects

Cites work

• A characterisation of rigid circuit graphs
• A note on superbrittle graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• scientific article; zbMATH DE number 3889565 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Incidence matrices and interval graphs
• On rigid circuit graphs
• On the semi-perfect elimination
• Polynomially bounded algorithms for locatingp-centers on a tree
• Scheduling Interval-Ordered Tasks
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Some aspects of perfect elimination orderings in chordal graphs
• Triangulated graphs and the elimination process
• Weak bipolarizable graphs
• Welsh-Powell opposition graphs

Cited in

(13)

• New linear time algorithms for generating perfect elimination orderings of chordal graphs
• On the semi-perfect elimination
• LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
• Perfect elimination orderings for symmetric matrices
• Oracles for vertex elimination orderings
• How vertex elimination can overachieve
• Error Theory for Elimination by Aspects
• scientific article; zbMATH DE number 4152428 (Why is no real title available?)
• A note on perfect partial elimination
• Chordal graphs and their clique graphs
• On domination elimination orderings and domination graphs
• Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
• Some aspects of perfect elimination orderings in chordal graphs

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

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