Pages that link to "Item:Q5189528"
From MaRDI portal
The following pages link to Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings (Q5189528):
Displaying 9 items.
- A general label search to investigate classical graph search algorithms (Q617648) (← links)
- Graph extremities defined by search algorithms (Q1662546) (← links)
- An introduction to clique minimal separator decomposition (Q1662549) (← 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)
- Bayesian networks: the minimal triangulations of a graph (Q2330088) (← links)
- Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS (Q2420652) (← links)
- (Q5874479) (← links)
- Semi-proper interval graphs (Q6648246) (← links)
