The following pages link to Niranka Banerjee (Q1625137):
Displaying 8 items.
- Maintaining chordal graphs dynamically: improved upper and lower bounds (Q1625138) (← links)
- Minimum transactions problem (Q1791032) (← links)
- Output sensitive fault tolerant maximum matching (Q2097219) (← links)
- Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
- Improved Space Efficient Algorithms for BFS, DFS and Applications (Q2817855) (← links)
- Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs (Q3196398) (← links)
- Fully dynamic arboricity maintenance (Q5918831) (← links)
- Fully dynamic arboricity maintenance (Q5919441) (← links)
