A linear Time Algorithm for Finding Depth-First Spanning Trees on Trapezoid Graphs

Abstract

Let G be a connected graph of n vertices and m edges. The problem of finding a depth-first spanning tree of G connecting the n vertices with n-1 edges by depth-first search. In this paper, we proposed an O(n) trapezoid graphs. Our algorithm cam also find depth-first spanning tress of permutation graphs in linear time.