Pages that link to "Item:Q4962745"

The following pages link to Fully dynamic algorithms for chordal graphs and split graphs (Q4962745):

Displaying 20 items.

• A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
• Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (Q442287) (← links)
• Fast minimal triangulation algorithm using minimum degree criterion (Q551209) (← links)
• Two methods for the generation of chordal graphs (Q940844) (← links)
• Minimal split completions (Q967310) (← links)
• On listing, sampling, and counting the chordal graphs with edge constraints (Q974754) (← links)
• Dynamically maintaining split graphs (Q1026107) (← links)
• Fully dynamic representations of interval graphs (Q1711837) (← links)
• Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
• A fully dynamic graph algorithm for recognizing interval graphs (Q1957648) (← links)
• A certifying and dynamic algorithm for the recognition of proper circular-arc graphs (Q2232611) (← links)
• Recognition of split-graphic sequences (Q2254547) (← links)
• Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network (Q2268854) (← links)
• Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)
• Maximal sub-triangulation in pre-processing phylogenetic data (Q2500753) (← links)
• A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs (Q3605497) (← links)
• Semi-dynamic algorithms for strongly chordal graphs (Q5013507) (← links)
• (Q5091062) (← links)
• Efficient local updates for undirected graphical models (Q5963562) (← links)
• Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs (Q6174822) (← links)