An efficient algorithm for edge-ranking trees

Xiao Zhou, Takao Nishizeki

研究成果: Conference contribution

7 被引用数 (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.

本文言語English
ホスト出版物のタイトルAlgorithms - ESA'94 - 2nd Annual European Symposium, Proceedings
編集者Jan van Leeuwen
出版社Springer Verlag
ページ118-129
ページ数12
ISBN(印刷版)9783540584346
DOI
出版ステータスPublished - 1994
イベント2nd Annual European Symposium on Algorithms, ESA 1994 - Utrecht, Netherlands
継続期間: 1994 9月 261994 9月 28

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
855 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other2nd Annual European Symposium on Algorithms, ESA 1994
国/地域Netherlands
CityUtrecht
Period94/9/2694/9/28

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「An efficient algorithm for edge-ranking trees」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル