Toward Characterization of Perfect Elimination Digraphs

DOI10.1137/0202018zbMath0288.05115OpenAlexW2075126330MaRDI QIDQ4775890

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

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

Related Items

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