Pages that link to "Item:Q846004"
From MaRDI portal
The following pages link to Adjacency queries in dynamic sparse graphs (Q846004):
Displaying 8 items.
- A \(13k\)-kernel for planar feedback vertex set via region decomposition (Q306250) (← links)
- A simple greedy algorithm for dynamic graph orientation (Q1986959) (← links)
- Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries (Q2942621) (← links)
- Simultaneously load balancing for every p-norm, with reassignments (Q4638106) (← links)
- Fully dynamic MIS in uniformly sparse graphs (Q5002774) (← links)
- Improved Dynamic Graph Coloring (Q5009642) (← links)
- (Q5136228) (← links)
- Fully dynamic arboricity maintenance (Q5918831) (← links)
