Debashis Bera

According to our database, Debashis Bera authored at least 4 papers between 1999 and 2003.

Collaborative distances:

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

2003

An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs.

Debashis Bera, Madhumangal Pal, Tapan Kumar Pal

Theory Comput. Syst., 2003

2002

An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs.

Debashis Bera, Madhumangal Pal, Tapan Kumar Pal

Int. J. Comput. Math., 2002

2000

An optimal parallel algorithm for computing cut vertices and blocks on interval graphs.

Madhumangal Pal, Sukumar Mondal, Debashis Bera, Tapan Kumar Pal

Int. J. Comput. Math., 2000

1999

An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs.

Debashis Bera, Tapan Kumar Pal, Madhumangal Pal

Int. J. Comput. Math., 1999