Finding optimal edge-rankings of trees

Xiao Zhou, Takao Nishizeki

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

5 Citations (Scopus)

Abstract

An edge-ranking of an undirected graph G is a labeling of the edges of G with integers such that every path between two edges with the same label i contains an edge with label j > i. An edge-ranking using a minimum number of ranks is called an optimal edge-ranking. The problem of finding an optimal edge-ranking of G has applications in scheduling the manufacture of complex multi-part products; it is equivalent to finding the minimum height edge separator tree of G. Polynomial-time algorithms for the problem on trees have been obtained, which find an optimal edge-ranking of a tree T in time O(n3 log n) where n is the number of vertices in T. In our previous paper we have given a simple O(n2) algorithm. This paper presents a more efficient algorithm, which finds an optimal edge-ranking of a tree in time O(n log n).

Original languageEnglish
Title of host publicationProceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995
PublisherAssociation for Computing Machinery
Pages122-131
Number of pages10
ISBN (Electronic)0898713498
Publication statusPublished - 1995 Jan 22
Event6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995 - San Francisco, United States
Duration: 1995 Jan 221995 Jan 24

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Other

Other6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995
CountryUnited States
CitySan Francisco
Period95/1/2295/1/24

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Finding optimal edge-rankings of trees'. Together they form a unique fingerprint.

Cite this