New, simpler linear-time dominators algorithm

被引:0
|
作者
AT and T Labs, Shannon Laboratory, 180 Park Ave., Florham Park, NJ 07932, United States [1 ]
机构
来源
ACM Trans Program Lang Syst | / 6卷 / 1265-1296期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [31] A LINEAR-TIME RECOGNITION ALGORITHM FOR INTERVAL DAGS
    GABOW, HN
    INFORMATION PROCESSING LETTERS, 1981, 12 (01) : 20 - 22
  • [32] A SIMPLE LINEAR-TIME ALGORITHM FOR INSITU MERGING
    MANNILA, H
    UKKONEN, E
    INFORMATION PROCESSING LETTERS, 1984, 18 (04) : 203 - 208
  • [33] A linear-time algorithm for trust region problems
    Hazan, Elad
    Koren, Tomer
    MATHEMATICAL PROGRAMMING, 2016, 158 (1-2) : 363 - 381
  • [34] Linear-time algorithm for sliding tokens on trees
    Demaine, Erik D.
    Demaine, Martin L.
    Fox-Epstein, Eli
    Hoang, Duc A.
    Ito, Takehiro
    Ono, Hirotaka
    Otachic, Yota
    Uehara, Ryuhei
    Yamada, Takeshi
    THEORETICAL COMPUTER SCIENCE, 2015, 600 : 132 - 142
  • [35] A linear-time algorithm for trust region problems
    Elad Hazan
    Tomer Koren
    Mathematical Programming, 2016, 158 : 363 - 381
  • [36] A Linear-Time Algorithm for Broadcast Domination in a Tree
    Dabney, John
    Dean, Brian C.
    Hedetniemi, Stephen T.
    NETWORKS, 2009, 53 (02) : 160 - 169
  • [37] A Linear-time Algorithm for Optimal Tree Completion
    Aiemvaravutigul, Chawin
    Wongwattanakij, Nonthaphat
    2019 16TH INTERNATIONAL JOINT CONFERENCE ON COMPUTER SCIENCE AND SOFTWARE ENGINEERING (JCSSE 2019), 2019, : 11 - 16
  • [38] A linear-time nearest point algorithm for the lattice An*
    McKilliam, Robby G.
    Clarkson, I. Vaughan L.
    Smith, Warren D.
    Quinn, Barry G.
    2008 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, VOLS 1-3, 2008, : 1239 - +
  • [39] NEW LINEAR-TIME ONLINE ALGORITHM FOR FINDING SMALLEST INITIAL PALINDROME OF A STRING
    MANACHER, G
    JOURNAL OF THE ACM, 1975, 22 (03) : 346 - 351
  • [40] A linear-time algorithm for finding a maximal planar subgraph
    Djidjev, Hristo N.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2006, 20 (02) : 444 - 462