Generalized edge-rankings of trees

Xiao Zhou, Md Abul Kashem, Takao Nishizeki

研究成果: Conference contribution

6 被引用数 (Scopus)

抄録

In this paper we newly define a generalized edge-ranking of a graph G as follows: for a positive integer c, a c-edge-ranking of G is a labeling (ranking) of the edges of G with integers such that, for any label i, deletion of all edges with labels > i leaves connected components, each having at most c edges with label i. The problem of finding an optimal c-edge-ranking of G, that is, a c-edge-ranking using the minimum number of ranks, has applications in scheduling the manufacture of complex multi-part products; it is equivalent to finding a c-edge-separator tree of G having the minimum height. We present an algorithm to find an optimal c-edge-ranking of a given tree T for any positive integer c in time 0(n2 log Δ), where n is the number of vertices in T and Δ is the maximum vertex-degree of T. Our algorithm is faster than the best algorithm known for the case c = 1.

本文言語English
ホスト出版物のタイトルGraph-Theoretic Concepts in Computer Science - 22nd International Workshop, WG 1996, Proceedings
ページ390-404
ページ数15
DOI
出版ステータスPublished - 1997 12 1
イベント22nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1996 - Cadenabbia, Italy
継続期間: 1996 6 121996 6 14

出版物シリーズ

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

Other

Other22nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1996
国/地域Italy
CityCadenabbia
Period96/6/1296/6/14

ASJC Scopus subject areas

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

フィンガープリント

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

引用スタイル