Pages that link to "Item:Q391972"
From MaRDI portal
The following pages link to Succinct encoding of arbitrary graphs (Q391972):
Displaying 14 items.
- Succinct posets (Q329288) (← links)
- Succinct navigational oracles for families of intersection graphs on a circle (Q2079878) (← links)
- Succinct representation for (non)deterministic finite automata (Q2084735) (← links)
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs (Q2150567) (← links)
- Succinct representations for (non)deterministic finite automata (Q2232264) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- Succinct encodings for families of interval graphs (Q2661990) (← links)
- Succinct encoding of binary strings representing triangulations (Q2665909) (← links)
- Compact representation of graphs with bounded bandwidth or treedepth (Q2672250) (← links)
- Adjacency Labeling Schemes and Induced-Universal Graphs (Q4610450) (← links)
- Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. (Q5005169) (← links)
- (Q5091062) (← links)
- Succinct data structure for path graphs (Q6178455) (← links)
- Succinct data structures for bounded clique-width graphs (Q6497944) (← links)
