Pages that link to "Item:Q551209"
From MaRDI portal
The following pages link to Fast minimal triangulation algorithm using minimum degree criterion (Q551209):
Displaying 11 items.
- Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (Q442287) (← links)
- Minimum degree triangulation for rectangular domains (Q1044720) (← links)
- Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network (Q2268854) (← links)
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
- Minimum Average Distance Triangulations (Q2912886) (← links)
- Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\) (Q2921757) (← links)
- (Q4252378) (← links)
- An algorithm for constructing locally optimal min-max triangulation (Q4346968) (← links)
- (Q4917827) (← links)
- A wide-range algorithm for minimal triangulation from an arbitrary ordering (Q5468869) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902510) (← links)
