Pages that link to "Item:Q5928875"
From MaRDI portal
The following pages link to Representing graphs implicitly using almost optimal space (Q5928875):
Displaying 6 items.
- On the OBDD representation of some graph classes (Q317396) (← links)
- Succinct posets (Q329288) (← links)
- On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706) (← links)
- Trading uninitialized space for time (Q834884) (← links)
- On the OBDD size for graphs of bounded tree- and clique-width (Q1011721) (← links)
- OPTIMAL FOLDING OF DATA FLOW GRAPHS BASED ON FINITE PROJECTIVE GEOMETRY USING VECTOR SPACE PARTITIONING (Q5411798) (← links)