An O(n) algorithm for realizing degree sequences (extended abstract)

被引：0
|
作者：
Arikati, SR
Maheshwari, A
机构：
来源：
FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE | 1994年 / 880卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
A sequence d = (d(1), d(2),...,d(n)) ofintegers is a degree sequence if there exists a (simple) graph G such that the components of d are equal to the degrees of the vertices of G. We present an O(n)-time sequential algorithm to realize d, i.e., to compute the graph G. We provide an efficient parallel implementation of our algorithm.
引用
收藏
页码：125 / 136
页数：12
相关论文
共 50 条
  • [11] An optimal algorithm for checking regularity -: (Extended Abstract)
    Kohayakawa, Y
    Rödl, V
    Thomas, L
    PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 277 - 286
  • [12] Minus domination in small-degree graphs (extended abstract)
    Damaschke, P
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1998, 1517 : 17 - 25
  • [13] Interval completion with the smallest max-degree - (Extended abstract)
    Fomin, FV
    Golovach, PA
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1998, 1517 : 359 - 371
  • [14] Undecidability results for low complexity degree structures extended abstract
    Downey, R
    Nies, A
    TWELFTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1997, : 128 - 132
  • [15] EFFICIENT AGREEMENT ON BOUNDED-DEGREE NETWORKS - (EXTENDED ABSTRACT)
    BERMAN, P
    GARAY, JA
    PROCEEDINGS OF THE 1989 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, VOL 1: ARCHITECTURE, 1989, : I188 - I191
  • [16] Aligning DNA sequences to minimize the change in protein - (Extended abstract)
    Hua, YF
    Jiang, T
    Wu, B
    COMBINATORIAL PATTERN MATCHING, 1998, 1448 : 221 - 234
  • [17] A parameterized algorithm for upward planarity testing (extended abstract)
    Chan, H
    ALGORITHMS ESA 2004, PROCEEDINGS, 2004, 3221 : 157 - 168
  • [18] AN EFFICIENT ALGORITHM FOR OPTIMAL LOOP PARALLELIZATION (EXTENDED ABSTRACT)
    IWANO, K
    YEH, S
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 450 : 201 - 210
  • [19] Application of the PageRank algorithm to alarm graphs - (Extended abstract)
    Treinen, James J.
    Thurimella, Ramakrishna
    INFORMATION AND COMMUNICATIONS SECURITY, PROCEEDINGS, 2007, 4681 : 480 - +
  • [20] An Algorithm for the Graph Crossing Number Problem [Extended Abstract]
    Chuzhoy, Julia
    STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING, 2011, : 303 - 312
12345