G. Sajith

According to our database, G. Sajith authored at least 10 papers between 1994 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

On Brooks' Theorem.

Gopalan Sajith, Sanjeev Saxena

CoRR, 2022

2004

The Persistent Buffer Tree : An I/O-efficient Index for Temporal Data

Saju Jude Dominic, G. Sajith

CoRR, 2004

The Random Buffer Tree : A Randomized Technique for I/O-efficient Algorithms

Saju Jude Dominic, G. Sajith

CoRR, 2004

2003

Fast parallel edge colouring of graphs.

G. Sajith, Sanjeev Saxena

J. Parallel Distributed Comput., 2003

Local Nature of Brooks' Colouring for Degree 3 Graphs.

G. Sajith, Sanjeev Saxena

Graphs Comb., 2003

2000

Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests.

G. Sajith, Sanjeev Saxena

Algorithmica, 2000

1999

Parallel Vertex Colouring of Interval Graphs.

G. Sajith, Sanjeev Saxena

Int. J. Found. Comput. Sci., 1999

1996

Optimal Parallel Algorithm for Brooks' Colouring Bounded Degree Graphs in Logarithmic Time on EREW PRAM.

G. Sajith, Sanjeev Saxena

Discret. Appl. Math., 1996

1995

Corrigendum: Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees.

G. Sajith, Sanjeev Saxena

Inf. Process. Lett., 1995

1994

Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees.

G. Sajith, Sanjeev Saxena

Inf. Process. Lett., 1994