Pages that link to "Item:Q819824"

The following pages link to A vertex incremental approach for maintaining chordality (Q819824):

Displaying 8 items.

• Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
• A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
• Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
• On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
• Treewidth computations. I: Upper bounds (Q964001) (← links)
• Characterizing and computing minimal cograph completions (Q972335) (← links)
• Dynamically maintaining split graphs (Q1026107) (← links)
• An introduction to clique minimal separator decomposition (Q1662549) (← links)