10 citations · 16 across the 2 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2013★ 21 cited
On Pairwise Spanners
Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha
Given an undirected -node unweighted graph , a spanner with stretch function is a subgraph such that, if two nodes are at distance in $…
cs.DS2011★ 6 cited
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew +2
We present two on-line algorithms for maintaining a topological order of a directed -vertex acyclic graph as arcs are added, and detecting a cycle when one is created. Our first…
cs.DS2007★ 10 cited
Faster Algorithms for Online Topological Ordering
Telikepalli Kavitha, Rogers Mathew
We present two algorithms for maintaining the topological order of a directed acyclic graph with n vertices, under an online edge insertion sequence of m edges. Efficient algorithm…