Pages that link to "Item:Q1377648"
From MaRDI portal
The following pages link to Efficient computation of implicit representations of sparse graphs (Q1377648):
Displaying 8 items.
- Trading uninitialized space for time (Q834884) (← links)
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition (Q992509) (← links)
- A note on finding compact sets in graphs represented by an adjacency list (Q1351637) (← links)
- A Constructive Arboricity Approximation Scheme (Q3297754) (← links)
- Efficient data structures for sparse network representation (Q3523690) (← links)
- (Q3836537) (← links)
- (Q4914762) (← links)
- Improved Dynamic Graph Coloring (Q5009642) (← links)