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 条
  • [11] ENUMERATION OF ROOTED OUTERPLANAR MAPS WITH VERTEX PARTITION
    刘彦佩
    Science Bulletin, 1987, (05) : 295 - 299
  • [12] A note on enumeration of one-vertex maps
    Orbanic, Alen
    Petkovsek, Marko
    Pisanski, Tomaz
    Potocnik, Primoz
    ARS MATHEMATICA CONTEMPORANEA, 2010, 3 (01) : 1 - 12
  • [13] 0/1 vertex and facet enumeration with BDDs
    Behle, Markus
    Eisenbrand, Friedrich
    PROCEEDINGS OF THE NINTH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS AND THE FOURTH WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS, 2007, : 158 - +
  • [14] ENUMERATION OF NONSEPARABLE OUTERPLANAR MAPS WITH VERTEX PARTITION
    LIU, YP
    KEXUE TONGBAO, 1987, 32 (24): : 1664 - 1668
  • [15] ENUMERATION OF ROOTED OUTERPLANAR MAPS WITH VERTEX PARTITION
    LIU, YP
    KEXUE TONGBAO, 1987, 32 (05): : 295 - 299
  • [16] COMPLEXITY OF ENUMERATION AND RELIABILITY PROBLEMS
    VALIANT, LG
    SIAM JOURNAL ON COMPUTING, 1979, 8 (03) : 410 - 421
  • [17] ENUMERATION OF ROOTED OUTERPLANAR MAPS WITH VERTEX PARTITION
    刘彦佩
    Science Bulletin, 1986, (05) : 295 - 299
  • [18] Total vertex enumeration in rooted planar maps
    Koganov, LM
    Liskovets, VA
    Walsh, TRS
    ARS COMBINATORIA, 2000, 54 : 149 - 160
  • [19] ENUMERATION AND SOLVING COMPLEXITY OF PREDICATES
    KANOVICH, MI
    DOKLADY AKADEMII NAUK SSSR, 1970, 190 (01): : 23 - &
  • [20] On the Complexity of Hard Enumeration Problems
    Creignou, Nadia
    Kroell, Markus
    Pichler, Reinhard
    Skritek, Sebastian
    Vollmer, Heribert
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2017), 2017, 10168 : 183 - 195
12345