The maximum matching and its related problems in convex bipartite graphs were studied by Glover (1967) and Lipski and Preparata (1981). This paper introduces circular conuex bipartite graphs andâ€¦ (More)

We present an 0 (n) time algorithm for jinding biconnected components in permutation graphs. The best known algorithm for this problem takes 0 (m + n) time in a general gruph of n vertices und mâ€¦ (More)

Whether there exists a polynomial algorithm for the minimal path cover problem in circular-arc graphs remains open. In this paper, we present a polynomial time algorithm for finding a minimal pathâ€¦ (More)

Trapezoid graphs are a superclass of permutation graphs and interval graphs. This paper presents first parallel algorithms for the independent domination, total domination, connected domination andâ€¦ (More)

We present anO(n log logn) time algorithm for finding a maximum matching in a permutation graph withn vertices, assuming that the input graph is represented by a permutation.

Finding bicormected components (BCs) of graphs is one of the fundamental problems in graph theory which has many practical applications. If n and ra are the number of the nodes and edges,â€¦ (More)