An efficient algorithm for edge-ranking trees

Xiao Zhou, Takao Nishizeki

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Citations (Scopus)


An edge-ranking of an undirected graph G is a labeling of the edges of G with integers such that all paths between two edges with the same label i contain an edge with label j > i. The problem of finding an edge-ranking of G using a minimum number of ranks has applications in scheduling the manufacture of complex multi-part products; it is equivalent to finding the minimum height edge separator tree. Deogun and Peng and independently de la Torre et al. have given polynomialtime algorithms which find an edge-ranking of trees T using a minimum number of ranks in time O(n3) and O(n3 log n) respectively, where n is the number of nodes in T. This paper presents a more efficient and simple algorithm, which finds an edge-ranking of trees using a minimum number of ranks in O(n2) time.

Original languageEnglish
Title of host publicationAlgorithms - ESA'94 - 2nd Annual European Symposium, Proceedings
EditorsJan van Leeuwen
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540584346
Publication statusPublished - 1994
Event2nd Annual European Symposium on Algorithms, ESA 1994 - Utrecht, Netherlands
Duration: 1994 Sept 261994 Sept 28

Publication series

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


Conference2nd Annual European Symposium on Algorithms, ESA 1994


Dive into the research topics of 'An efficient algorithm for edge-ranking trees'. Together they form a unique fingerprint.

Cite this