received considerable attention and has been shown to be very useful in the design of simple linear time algorithms for a number of diverse applications.

Jan 10, 2017 · We study the use of a series of successive LBFS searches in order to capture the structure of these graphs.

Jan 1, 1999 · Contents. SODA '99: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms. LBFS orderings and cocomparability graphs. Pages ...

On cocomparability graphs many problems like coloring, Hamilton path, maximal clique which are NP-complete in the general case can be solved in polynomial time.

Oct 1, 2013 · An ordering 7 is an LBFS ordering iff for all a <7 b <7 c where ac ... order, the interval algorithm works perfectly on cocomparability graphs.

LBFS+ is a variant of the generic Lexicographic Breadth First Search (LBFS), which uses a specific tie-breaking mechanism. Starting with some ordering σ0 of G ...

This thesis gives new structural and algorithmic results on cocomparability (ccp) graphs by connecting structural properties of graph searching to those of ...

In this paper we study how graph searching on a cocomparability graph G can be used to produce cocomp orderings (i.e., orderings that are linear extensions ...

Their funda- mental paper showed that a graph is chordal if and only if any LBFS will result in an ordering of the vertex set that satisfies the condition that ...

For many classes of graphs using LBFS ordering ”backward” provides structural information on the graph. 3. Last visited vertex (or clique) has some property ...