Moplex orderings generated by the LexDFs algorithm

DOI10.1016/j.dam.2013.02.028zbMath1287.05153OpenAlexW2101007342MaRDI QIDQ2446863

Shou-Jun Xu, Ronghua Liang, Xianyue Li

Publication date: 22 April 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2013.02.028

zbMATH Keywords

chordal graphmoplexDFSLexBFsLexDFs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

Computing a clique tree with the algorithm maximal label search ⋮ Robinsonian matrices: recognition challenges ⋮ Organizing the atoms of the clique separator decomposition into an atom tree ⋮ Finding biclique partitions of co-chordal graphs ⋮ Unnamed Item ⋮ Clustering analysis of a dissimilarity: a review of algebraic and geometric representation

Cites Work

• On rigid circuit graphs
• Separability generalizes Dirac's theorem
• Graph extremities defined by search algorithms
• A characterisation of rigid circuit graphs
• A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
• Incidence matrices and interval graphs
• Minimum Average Distance Clique Trees
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• A Unified View of Graph Searching
• Algorithmic Aspects of Vertex Elimination on Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Moplex orderings generated by the LexDFs algorithm