The following pages link to Sanjeev Saxena (Q396685):
Displaying 4 items.
- Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs (Q396686) (← links)
- Maximum cardinality neighbourly sets in quadrilateral free graphs (Q511689) (← links)
- Maximal independent sets in a generalisation of caterpillar graph (Q512892) (← links)
- An efficient parallel algorithm for building the separating tree (Q666141) (← links)
