The following pages link to Moplex elimination orderings (Q2816011):
Displaying 10 items.
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- Separability generalizes Dirac's theorem (Q1392561) (← links)
- Computing a clique tree with the algorithm maximal label search (Q1662609) (← links)
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph (Q1944936) (← links)
- Moplex orderings generated by the LexDFs algorithm (Q2446863) (← links)
- Vertex elimination orderings for hereditary graph classes (Q2514166) (← links)
- Extremities and orderings defined by generalized graph search algorithms (Q3439374) (← links)
- Finding cut-vertices in the square roots of a graph (Q5915963) (← links)
- Graphs with at most two moplexes (Q6595515) (← links)
