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 条
  • [21] AutoFolio: An Automatically Configured Algorithm Selector (Extended Abstract)
    Lindauer, Marius
    Hutter, Frank
    Hoos, Holger H.
    Schaub, Torsten
    PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 5025 - 5029
  • [22] Graph Partitioning Algorithm with LSH Poster extended abstract
    Zhang, Weidong
    Zhang, Mingyue
    2018 IEEE INTERNATIONAL CONFERENCE ON CLUSTER COMPUTING (CLUSTER), 2018, : 166 - 167
  • [23] A Survey of Methods for Automated Algorithm Configuration (Extended Abstract)
    Schede, Elias
    Brandt, Jasmin
    Tornede, Alexander
    Wever, Marcel
    Bengs, Viktor
    Huellermeier, Eyke
    Tierney, Kevin
    PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, 2023, : 6964 - 6968
  • [24] Incremental discovery of irredundant motif bases in time O(|Σ|n2 log n) (Extended abstract)
    Apostolico, Alberto
    Tagliacollo, Claudia
    ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2007, 4645 : 136 - 148
  • [25] Extended Abstract: Detecting Scareware by Mining Variable Length Instruction Sequences
    Shahzad, Raja Khurram
    Lavesson, Niklas
    ELEVENTH SCANDINAVIAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (SCAI 2011), 2011, 227 : 195 - 196
  • [26] On the k-operation linear complexity of periodic sequences (extended abstract)
    Kavuluru, Ramakanth
    Mapper, Andrew
    PROGRESS IN CRYPTOLOGY - INDOCRYPT 2007, 2007, 4859 : 322 - 330
  • [27] Realizing disjoint degree sequences of span at most two A tractable discrete tomography problem
    Guinez, F.
    Matamala, M.
    Thomasse, S.
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (01) : 23 - 30
  • [28] Realizing degree sequences with graphs having nowhere-zero 3-flows
    Luo, Rong
    Xu, Rui
    Zang, Wenan
    Zhang, Cun-Quan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2008, 22 (02) : 500 - 519
  • [29] Complexity of n-Queens Completion (Extended Abstract)
    Gent, Ian P.
    Jefferson, Christopher
    Nightingale, Peter
    PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2018, : 5608 - 5611
  • [30] A robust O(N log N) algorithm for optimal decoding of first-order Σ-Δ sequences
    McIlrath, LG
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2002, 50 (08) : 1942 - 1950
12345