The following pages link to (Q4252412):
Displaying 10 items.
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Dynamically maintaining split graphs (Q1026107) (← links)
- A fully dynamic algorithm for modular decomposition and recognition of cographs. (Q1427188) (← links)
- Fully dynamic recognition algorithm and certificate for directed cographs (Q2499593) (← links)
- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints (Q3511357) (← links)
- Dynamic Distance Hereditary Graphs Using Split Decomposition (Q5387744) (← links)
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs (Q5961976) (← links)
