The following pages link to G. Sajith (Q185595):
Displaying 14 items.
- Fast parallel edge colouring of graphs. (Q1414732) (← links)
- Local nature of Brooks' colouring for degree 3 graphs (Q1423503) (← links)
- Gelfand pairs, \(K\)-spherical means and injectivity on the Heisenberg group (Q1808880) (← 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)
- I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs (Q2339449) (← links)
- An I/O Efficient Algorithm for Minimum Spanning Trees (Q3467866) (← links)
- An Input/Output Efficient Algorithm for Hessenberg Reduction (Q5207035) (← links)
- PARALLEL VERTEX COLOURING OF INTERVAL GRAPHS (Q5248988) (← links)
- I/O Efficient Algorithms for the Minimum Cut Problem on Unweighted Undirected Graphs (Q5746257) (← 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)
- On the injectivity of twisted spherical means of \(\mathbb{C}^n\) (Q5935801) (← links)
- Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees (Q5966148) (← links)
