FAST EXPONENTIAL-TIME ALGORITHMS FOR THE FOREST COUNTING AND THE TUTTE POLYNOMIAL COMPUTATION IN GRAPH CLASSES

被引：2
|
作者：
Gebauer, Heidi [1 ]
Okamoto, Yoshio [2 ]
机构：
[1] ETH, Inst Theoret Comp Sci, CH-8092 Zurich, Switzerland
[2] Toyohashi Univ Technol, Dept Informat & Comp Sci, Tempaku Ku, Aichi 4418580, Japan
来源：
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | 2009年 / 20卷 / 01期
关键词：
chordal graph; exponential-time algorithm; forest; regular graph; Tutte polynomial; unit interval graph; PLANAR GRAPHS; COMPLEXITY; WIDTH;
D O I：
10.1142/S0129054109006437
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We prove #P-completeness for counting the number of forests in regular graphs and chordal graphs. We also present algorithms for this problem, running in O*(1.8494(m)) time for 3-regular graphs, and O*(1.9706(m)) time for unit interval graphs, where m is the number of edges in the graph and O*-notation ignores a polynomial factor. The algorithms can be generalized to the Tutte polynomial computation.
引用
收藏
页码：25 / 44
页数：20
相关论文
共 50 条
  • [1] The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms
    Chen, Hubie
    Curticapean, Radu
    Dell, Holger
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2019), 2019, 11789 : 364 - 378
  • [2] Exponential-Time Quantum Algorithms for Graph Coloring Problems
    Kazuya Shimizu
    Ryuhei Mori
    [J]. Algorithmica, 2022, 84 : 3603 - 3621
  • [3] Exponential-Time Quantum Algorithms for Graph Coloring Problems
    Shimizu, Kazuya
    Mori, Ryuhei
    [J]. ALGORITHMICA, 2022, 84 (12) : 3603 - 3621
  • [4] Faster exponential-time algorithms for approximately counting independent sets
    Goldberg, Leslie Ann
    Lapinskas, John
    Richerby, David
    [J]. THEORETICAL COMPUTER SCIENCE, 2021, 892 : 48 - 84
  • [5] Formulas for the computation of the Tutte polynomial of graphs with parallel classes
    Mphako-Banda, Eunice
    Allagan, Julian A.
    [J]. ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2018, 6 (01) : 113 - 122
  • [6] Separating classes in the exponential-time hierarchy from classes in PH
    Mocas, SE
    [J]. THEORETICAL COMPUTER SCIENCE, 1996, 158 (1-2) : 221 - 231
  • [7] Moderate exponential-time algorithms for scheduling problems
    T'kindt, Vincent
    Croce, Federico Della
    Liedloff, Mathieu
    [J]. ANNALS OF OPERATIONS RESEARCH, 2024,
  • [8] Moderate exponential-time algorithms for scheduling problems
    T'kindt, Vincent
    Della Croce, Federico
    Liedloff, Mathieu
    [J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2022, 20 (04): : 533 - 566
  • [9] Moderate exponential-time algorithms for scheduling problems
    Vincent T’kindt
    Federico Della Croce
    Mathieu Liedloff
    [J]. 4OR, 2022, 20 : 533 - 566
  • [10] Exact exponential-time algorithms for finding bicliques
    Binkele-Raible, Daniel
    Fernau, Henning
    Gaspers, Serge
    Liedloff, Mathieu
    [J]. INFORMATION PROCESSING LETTERS, 2010, 111 (02) : 64 - 67
12345