On the vertex ranking problem for trapezoid, circular-arc and other graphs

Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller

Research output: Contribution to journalArticle

25 Citations (Scopus)

Abstract

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 languageEnglish (US)
Pages (from-to)39-63
Number of pages25
JournalDiscrete Applied Mathematics
Volume98
Issue number1-2
DOIs
StatePublished - Oct 30 1999

Fingerprint

Trapezoid Graph
Trapezium or trapezoid
Circular-arc Graphs
Ranking
Arc of a curve
Separator
Separators
Polynomial-time Algorithm
Graph in graph theory
Vertex of a graph
Polynomials
Permutation Graphs
Interval Graphs
Graph Classes
Dynamic programming
Dynamic Programming
Intersection
Demonstrate
Model

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this

On the vertex ranking problem for trapezoid, circular-arc and other graphs. / Deogun, Jitender S.; Kloks, Ton; Kratsch, Dieter; Müller, Haiko.

In: Discrete Applied Mathematics, Vol. 98, No. 1-2, 30.10.1999, p. 39-63.

Research output: Contribution to journalArticle

Deogun, Jitender S. ; Kloks, Ton ; Kratsch, Dieter ; Müller, Haiko. / On the vertex ranking problem for trapezoid, circular-arc and other graphs. In: Discrete Applied Mathematics. 1999 ; Vol. 98, No. 1-2. pp. 39-63.
@article{14ba5131764941529077481bb17279ed,
title = "On the vertex ranking problem for trapezoid, circular-arc and other graphs",
abstract = "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.",
author = "Deogun, {Jitender S.} and Ton Kloks and Dieter Kratsch and Haiko M{\"u}ller",
year = "1999",
month = "10",
day = "30",
doi = "10.1016/S0166-218X(99)00179-1",
language = "English (US)",
volume = "98",
pages = "39--63",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - On the vertex ranking problem for trapezoid, circular-arc and other graphs

AU - Deogun, Jitender S.

AU - Kloks, Ton

AU - Kratsch, Dieter

AU - Müller, Haiko

PY - 1999/10/30

Y1 - 1999/10/30

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0141879098&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0141879098&partnerID=8YFLogxK

U2 - 10.1016/S0166-218X(99)00179-1

DO - 10.1016/S0166-218X(99)00179-1

M3 - Article

AN - SCOPUS:0141879098

VL - 98

SP - 39

EP - 63

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 1-2

ER -