Moplex orderings generated by the LexDFs algorithm
From MaRDI portal
Publication:2446863
Recommendations
Cites work
- A characterisation of rigid circuit graphs
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
- A Unified View of Graph Searching
- Algorithmic Aspects of Vertex Elimination on Graphs
- Graph extremities defined by search algorithms
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 751126 (Why is no real title available?)
- Incidence matrices and interval graphs
- Minimum average distance clique trees
- On rigid circuit graphs
- Separability generalizes Dirac's theorem
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
Cited in
(9)- Separability generalizes Dirac's theorem
- Computing a clique tree with the algorithm maximal label search
- Robinsonian matrices: recognition challenges
- Moplex elimination orderings
- Organizing the atoms of the clique separator decomposition into an atom tree
- scientific article; zbMATH DE number 7651152 (Why is no real title available?)
- Finding biclique partitions of co-chordal graphs
- Graphs with at most two moplexes
- Clustering analysis of a dissimilarity: a review of algebraic and geometric representation
This page was built for publication: Moplex orderings generated by the LexDFs algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446863)