On vertex ranking for permutation and other graphs

J. S. Deogun, T. Kloks, D. Kratsch, H. Müller

Research output: Chapter in Book/Report/Conference proceedingConference contribution

44 Citations (Scopus)

Abstract

In this paper we show that an optimal vertex ranking of a permutation graph can be computed in time O(n6), where n is the number of vertices. The demonstrated minimal separator approach can also be used for designing polynomial time algorithms computing an optimal vertex ranking on the following classes of well-structured graphs: circular permutation graphs, interval graphs, circular arc graphs, trapezoid graphs and cocomparability graphs of bounded dimension.

Original languageEnglish (US)
Title of host publicationSTACS 1994 - 11th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
EditorsErnst W. Mayr, Klaus W. Wagner, Patrice Enjalbert
PublisherSpringer Verlag
Pages747-758
Number of pages12
ISBN (Print)9783540577850
StatePublished - Jan 1 1994
EventProceedings of the 11th Symposium on Theoretical Aspects of Computer Science (STACS'94) - Caen, Fr
Duration: Feb 24 1994Feb 26 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume775 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherProceedings of the 11th Symposium on Theoretical Aspects of Computer Science (STACS'94)
CityCaen, Fr
Period2/24/942/26/94

Fingerprint

Permutation Graphs
Separators
Ranking
Permutation
Trapezoid Graph
Polynomials
Circular-arc Graphs
Interval Graphs
Separator
Graph in graph theory
Vertex of a graph
Polynomial-time Algorithm
Computing
Class

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Deogun, J. S., Kloks, T., Kratsch, D., & Müller, H. (1994). On vertex ranking for permutation and other graphs. In E. W. Mayr, K. W. Wagner, & P. Enjalbert (Eds.), STACS 1994 - 11th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings (pp. 747-758). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 775 LNCS). Springer Verlag.

On vertex ranking for permutation and other graphs. / Deogun, J. S.; Kloks, T.; Kratsch, D.; Müller, H.

STACS 1994 - 11th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. ed. / Ernst W. Mayr; Klaus W. Wagner; Patrice Enjalbert. Springer Verlag, 1994. p. 747-758 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 775 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Deogun, JS, Kloks, T, Kratsch, D & Müller, H 1994, On vertex ranking for permutation and other graphs. in EW Mayr, KW Wagner & P Enjalbert (eds), STACS 1994 - 11th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 775 LNCS, Springer Verlag, pp. 747-758, Proceedings of the 11th Symposium on Theoretical Aspects of Computer Science (STACS'94), Caen, Fr, 2/24/94.
Deogun JS, Kloks T, Kratsch D, Müller H. On vertex ranking for permutation and other graphs. In Mayr EW, Wagner KW, Enjalbert P, editors, STACS 1994 - 11th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Springer Verlag. 1994. p. 747-758. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Deogun, J. S. ; Kloks, T. ; Kratsch, D. ; Müller, H. / On vertex ranking for permutation and other graphs. STACS 1994 - 11th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. editor / Ernst W. Mayr ; Klaus W. Wagner ; Patrice Enjalbert. Springer Verlag, 1994. pp. 747-758 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{6fd9cb9c75ff4b91af378532a69accbc,
title = "On vertex ranking for permutation and other graphs",
abstract = "In this paper we show that an optimal vertex ranking of a permutation graph can be computed in time O(n6), where n is the number of vertices. The demonstrated minimal separator approach can also be used for designing polynomial time algorithms computing an optimal vertex ranking on the following classes of well-structured graphs: circular permutation graphs, interval graphs, circular arc graphs, trapezoid graphs and cocomparability graphs of bounded dimension.",
author = "Deogun, {J. S.} and T. Kloks and D. Kratsch and H. M{\"u}ller",
year = "1994",
month = "1",
day = "1",
language = "English (US)",
isbn = "9783540577850",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "747--758",
editor = "Mayr, {Ernst W.} and Wagner, {Klaus W.} and Patrice Enjalbert",
booktitle = "STACS 1994 - 11th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings",

}

TY - GEN

T1 - On vertex ranking for permutation and other graphs

AU - Deogun, J. S.

AU - Kloks, T.

AU - Kratsch, D.

AU - Müller, H.

PY - 1994/1/1

Y1 - 1994/1/1

N2 - In this paper we show that an optimal vertex ranking of a permutation graph can be computed in time O(n6), where n is the number of vertices. The demonstrated minimal separator approach can also be used for designing polynomial time algorithms computing an optimal vertex ranking on the following classes of well-structured graphs: circular permutation graphs, interval graphs, circular arc graphs, trapezoid graphs and cocomparability graphs of bounded dimension.

AB - In this paper we show that an optimal vertex ranking of a permutation graph can be computed in time O(n6), where n is the number of vertices. The demonstrated minimal separator approach can also be used for designing polynomial time algorithms computing an optimal vertex ranking on the following classes of well-structured graphs: circular permutation graphs, interval graphs, circular arc graphs, trapezoid graphs and cocomparability graphs of bounded dimension.

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

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

M3 - Conference contribution

AN - SCOPUS:0008491536

SN - 9783540577850

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 747

EP - 758

BT - STACS 1994 - 11th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings

A2 - Mayr, Ernst W.

A2 - Wagner, Klaus W.

A2 - Enjalbert, Patrice

PB - Springer Verlag

ER -