10 citations · 25 across the 8 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011
On Rainbow Connection Number and Connectivity
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
Rainbow connection number, , of a connected graph is the minimum number of colours needed to colour its edges, so that every pair of vertices is connected by at least on…
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…