Pages that link to "Item:Q5961976"
From MaRDI portal
The following pages link to Fully dynamic algorithm for recognition and modular decomposition of permutation graphs (Q5961976):
Displaying 12 items.
- Permutation bigraphs and interval containments (Q401140) (← links)
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← links)
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem (Q1720313) (← links)
- A certifying and dynamic algorithm for the recognition of proper circular-arc graphs (Q2232611) (← links)
- Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- Succinct permutation graphs (Q2684486) (← links)
- An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem (Q2827805) (← links)
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs (Q5919325) (← links)
- Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs (Q6174822) (← links)
