THE COMPLEXITY OF VERTEX ENUMERATION METHODS

被引：98
|
作者：
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 条
  • [31] The communication complexity of enumeration, elimination, and selection
    Ambainis, A
    Buhrman, H
    Gasarch, W
    Kalyanasundaram, B
    Torenvliet, L
    15TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 44 - 53
  • [32] On the Enumeration Complexity of Unions of Conjunctive Queries
    Carmeli, Nofar
    Kroell, Markus
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2021, 46 (02):
  • [33] On the Enumeration Complexity of Unions of Conjunctive Queries
    Carmeli, Nofar
    Kroell, Markus
    PROCEEDINGS OF THE 38TH ACM SIGMOD-SIGACT-SIGAI SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS (PODS '19), 2019, : 134 - 148
  • [34] A complexity theory for hard enumeration problems
    Creignou, Nadia
    Kroell, Markus
    Pichler, Reinhard
    Skritek, Sebastian
    Vollmer, Nate Heribert
    DISCRETE APPLIED MATHEMATICS, 2019, 268 : 191 - 209
  • [35] Complexity and Enumeration in Models of Genome Rearrangement
    Bailey, Lora
    Blake, Heather Smith
    Cochran, Garner
    Fox, Nathan
    Levet, Michael
    Mahmoud, Reem
    Matson, Elizabeth Bailey
    Singgih, Inne
    Stadnyk, Grace
    Wang, Xinyi
    Wiedemann, Alexander
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2024, 14422 LNCS : 3 - 14
  • [36] Complexity and enumeration in models of genome rearrangement
    Bailey, Lora
    Blake, Heather Smith
    Cochran, Garner
    Fox, Nathan
    Levet, Michael
    Mahmoud, Reem
    Matson, Elizabeth Bailey
    Singgih, Inne
    Stadnyk, Grace
    Wang, Xinyi
    Wiedemann, Alexander
    Theoretical Computer Science, 2024, 1022
  • [37] The Input/Output Complexity of Triangle Enumeration
    Pagh, Rasmus
    Silvestri, Francesco
    PODS'14: PROCEEDINGS OF THE 33RD ACM SIGMOD-SIGACT-SIGART SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, 2014, : 224 - 233
  • [38] On the complexity of some enumeration problems for matroids
    Khachiyan, L
    Boros, E
    Elbassioni, K
    Gurvich, V
    Makino, K
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2006, 19 (04) : 966 - 984
  • [39] Reduced word enumeration, complexity, and randomization
    Monical, Cara
    Pankow, Benjamin
    Yong, Alexander
    ELECTRONIC JOURNAL OF COMBINATORICS, 2022, 29 (02):
  • [40] The communication complexity of enumeration, elimination, and selection
    Ambainis, A
    Buhrman, H
    Gasarch, W
    Kalyanasundaram, B
    Torenvliet, L
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 63 (02) : 148 - 185
12345