Graph theory has developed into a very broad field since its introduction by Euler in the 18th
century. Graphs are an intuitively pleasing and flexible method for dealing with relationships …

In this paper, we study the maximum matching problem in RDV graphs, ie, graphs that are
vertex-intersection graphs of downward paths in a rooted tree. We show that this problem …

We first design an O (n2) solution for finding a maximum induced matching in permutation
graphs given their permutation models, based on a dynamic programming algorithm with the …

Trapezoid graphs are intersection graphs of trapezoids between two horizontal lines. Many
NP-hard problems can be solved in polynomial time if they are restricted on trapezoid …

We show that there exist efficient algorithms for the triangle packing problem in colored
permutation graphs, complete multipartite graphs, distance-hereditary graphs, k-modular …

An O (n3) time algorithm for obtaining the minimum vertex ranking spanning tree on
permutation graphs Page 250 An O ( n3 ) Time Algorithm for Obtaining the Minimum Vertex …

We present a cost-optimal parallel algorithm for the maximum matching problem on bipartite
permutation graphs on an EREW PRAM. Previously, Chen and Yesha have dealt with this …

Trapezoid graphs are intersection graphs of trapezoids between two horizontal lines. Many
graph problems that are NP-hard in general case have polynomial time algorithms for …

Though graph theory has a long history of research, mostly it has concentrated on
theoretical foundations. However, for the last two decades, the research in algorithmic graph …