THE COMPLEXITY OF VERTEX ENUMERATION METHODS

被引：100
作者：
DYER, ME
机构：
来源：
MATHEMATICS OF OPERATIONS RESEARCH | 1983年 / 8卷 / 03期
关键词：
D O I：
10.1287/moor.8.3.381
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
44
引用
收藏
页码：381 / 402
页数：22
相关论文
共 50 条
  • [41] ASYMPTOTIC METHODS IN ENUMERATION
    BENDER, EA
    SIAM REVIEW, 1974, 16 (04) : 485 - 515
  • [42] ENUMERATION METHODS OF REDFIELD
    HARARY, F
    PALMER, E
    AMERICAN JOURNAL OF MATHEMATICS, 1967, 89 (02) : 373 - &
  • [43] ISOMER ENUMERATION METHODS
    ROUVRAY, DH
    CHEMICAL SOCIETY REVIEWS, 1974, 3 (03) : 355 - 372
  • [44] The Complexity of Degree Anonymization by Vertex Addition
    Bredereck, Robert
    Froese, Vincent
    Hartung, Sepp
    Nichterlein, Andre
    Niedermeier, Rolf
    Talmon, Nimrod
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, AAIM 2014, 2014, 8546 : 44 - 55
  • [45] The complexity of degree anonymization by vertex addition
    Bredereck, Robert
    Froese, Vincent
    Hartung, Sepp
    Nichterlein, Andre
    Niedermeier, Rolf
    Talmon, Nimrod
    THEORETICAL COMPUTER SCIENCE, 2015, 607 : 16 - 34
  • [46] Complexity of approximating the vertex centroid of a polyhedron
    Elbassioni, Khaled
    Tiwary, Hans Raj
    THEORETICAL COMPUTER SCIENCE, 2012, 421 : 56 - 61
  • [47] On the Complexity of Singly Connected Vertex Deletion
    Das, Avinandan
    Kanesh, Lawqueen
    Madathil, Jayakrishnan
    Muluk, Komal
    Purohit, Nidhi
    Saurabh, Saket
    COMBINATORIAL ALGORITHMS, IWOCA 2020, 2020, 12126 : 237 - 250
  • [48] On the complexity of the balanced vertex ordering problem
    Kara, Jan
    Kratochvil, Jan
    Wood, David R.
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2007, 9 (01) : 193 - 202
  • [49] On the Parameterized Complexity of Happy Vertex Coloring
    Agrawal, Akanksha
    COMBINATORIAL ALGORITHMS, IWOCA 2017, 2018, 10765 : 103 - 115
  • [50] On the complexity of singly connected vertex deletion
    Das, Avinandan
    Kanesh, Lawqueen
    Madathil, Jayakrishnan
    Muluk, Komal
    Purohit, Nidhi
    Saurabh, Saket
    THEORETICAL COMPUTER SCIENCE, 2022, 934 : 47 - 64
12345