Toward Characterization of Perfect Elimination Digraphs

DOI10.1137/0202018MaRDI QIDQ4775890zbMATH OpenOpenAlexFDO

Authors L. Haskins, Donald J. Rose

Publication date 1973

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0202018

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Numerical linear algebra (65F99) Analysis of algorithms and problem complexity (68Q25)

Cited in

(15)

• Strong Chordality of Graphs with Possible Loops
• A remark on perfect Gaussian elimination of symmetric matrices
• Chordal digraphs
• Recognition of perfect elimination bipartite graphs
• A note on perfect Gaussian elimination
• Chordality of locally semicomplete and weakly quasi-transitive digraphs
• Comparability digraphs: an analogue of comparability graphs
• An algorithm for testing chordality of graphs
• Recognizing sparse perfect elimination bipartite graphs
• On simple characterizations of k-trees
• Partitioning, tearing and modification of sparse linear systems
• Semi-strict chordal digraphs
• Semi-strict chordality of digraphs
• Strict chordal and strict split digraphs
• Digraphs of bounded elimination width

This page was built for publication: Toward Characterization of Perfect Elimination Digraphs

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