The following pages link to Sanjeev Saxena (Q396685):
Displaying 32 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)
- Dominance made simple (Q987777) (← links)
- On finding fundamental cut sets (Q990139) (← links)
- (Q1175943) (redirect page) (← links)
- Improved deterministic parallel integer sorting (Q1175944) (← links)
- Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space (Q1318772) (← links)
- Parallel algorithms for connectivity problems on interval graphs (Q1350233) (← links)
- Parallel algorithm for finding the most vital edge in weighted graphs (Q1384523) (← links)
- Fast parallel edge colouring of graphs. (Q1414732) (← links)
- Local nature of Brooks' colouring for degree 3 graphs (Q1423503) (← links)
- An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs (Q1607053) (← links)
- Algorithms for testing occurrences of length 4 patterns in permutations (Q1698070) (← links)
- Parallel algorithms for separable permutations (Q1763485) (← links)
- Parallel integer sorting and simulation amongst CRCW models (Q1901715) (← links)
- Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM (Q1917253) (← links)
- Optimal sublogarithmic time parallel algorithms on rooted forests (Q1977136) (← links)
- Faster algorithm to find anti-risk path between two nodes of an undirected graph (Q2015812) (← links)
- Zone theorem for arrangements in dimension three (Q2234787) (← links)
- A still simpler way of introducing interior-point method for linear programming (Q2374256) (← links)
- Faster Replacement Paths Algorithm for Undirected, Positive Integer Weighted Graphs with Small Diameter (Q2876562) (← links)
- (Q3817623) (← links)
- (Q4643838) (← links)
- All Nearest Smallers Made Simple (Q5087073) (← links)
- PARALLEL VERTEX COLOURING OF INTERVAL GRAPHS (Q5248988) (← links)
- Algorithms for Testing Length Four Permutations (Q5405913) (← links)
- (Q5453974) (← links)
- Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees (Q5894617) (← links)
- Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees (Q5906512) (← links)
- Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees (Q5966148) (← links)
