Pages that link to "Item:Q2661990"
From MaRDI portal
The following pages link to Succinct encodings for families of interval graphs (Q2661990):
Displaying 9 items.
- Succinct encoding of arbitrary graphs (Q391972) (← links)
- Succinct navigational oracles for families of intersection graphs on a circle (Q2079878) (← links)
- Compact representation of graphs with bounded bandwidth or treedepth (Q2672250) (← links)
- Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number (Q2680858) (← links)
- Succinct permutation graphs (Q2684486) (← links)
- Shorter Labeling Schemes for Planar Graphs (Q5866447) (← links)
- Succinct data structures for bounded clique-width graphs (Q6497944) (← links)
- Distance queries over dynamic interval graphs (Q6577442) (← links)
- Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs (Q6610090) (← links)