Pages that link to "Item:Q2921757"

The following pages link to Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\) (Q2921757):

Displaying 11 items.

• Fast minimal triangulation algorithm using minimum degree criterion (Q551209) (← links)
• Minimal fill in O(\(n^{2.69}\)) time (Q819828) (← links)
• Characterizing and computing minimal cograph completions (Q972335) (← links)
• Minimal interval completion through graph exploration (Q1001896) (← links)
• Efficiently enumerating minimal triangulations (Q1983135) (← links)
• Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network (Q2268854) (← links)
• Minimal comparability completions of arbitrary graphs (Q2476257) (← links)
• Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
• A wide-range algorithm for minimal triangulation from an arbitrary ordering (Q5468869) (← links)
• Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376) (Q5470799) (← links)
• Graph-Theoretic Concepts in Computer Science (Q5902510) (← links)