We present polynomial time algorithms to solve the VERTEX RANKING problem for graphs of various graph classes among them trapezoid graphs, permutation graphs and circular-arc graphs. We demonstrate our approach in detail for a generalization of interval and trapezoid graphs called d-trapezoid graphs and for circular-arc graphs. All our algorithms use an approach called dynamic programming on pieces. Among others it exploits the property that all minimal separators and all the so-called pieces of these graphs can be represented by scanlines of an intersection model. This enables the design of polynomial time algorithms to list both all minimal separators and all pieces of an input graph.
|Original language||English (US)|
|Number of pages||25|
|Journal||Discrete Applied Mathematics|
|State||Published - Oct 30 1999|
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics