Complexity and Approximability of the Cover Polynomial

被引：0
|
作者：
Markus Bläser
Holger Dell
Mahmoud Fouz
机构：
[1] Saarland University,Department of Computer Science
[2] Humboldt University of Berlin,Department of Computer Science
来源：
computational complexity | 2012年 / 21卷
关键词：
Graph polynomial; counting complexity; approximation; permanent; Tutte polynomial; 68Q17; 05C99;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The cover polynomial and its geometric version introduced by Chung & Graham and D’Antona & Munarini, respectively, are two-variate graph polynomials for directed graphs. They count the (weighted) number of ways to cover a graph with disjoint directed cycles and paths, can be thought of as interpolations between determinant and permanent, and are proposed as directed analogues of the Tutte polynomial.
引用
收藏
页码：359 / 419
页数：60
相关论文
共 50 条
  • [1] Complexity and Approximability of the Cover Polynomial
    Blaeser, Markus
    Dell, Holger
    Fouz, Mahmoud
    COMPUTATIONAL COMPLEXITY, 2012, 21 (03) : 359 - 419
  • [2] Weighted upper edge cover: Complexity and approximability
    Khoshkhah K.
    Ghadikolaei M.K.
    Monnot J.
    Sikora F.
    Journal of Graph Algorithms and Applications, 2020, 24 (02) : 65 - 88
  • [3] Weighted Upper Edge Cover: Complexity and Approximability
    Khoshkhah, Kaveh
    Ghadikolaei, Mehdi Khosravian
    Monnot, Jerome
    Sikora, Florian
    WALCOM: ALGORITHMS AND COMPUTATION (WALCOM 2019), 2019, 11355 : 235 - 247
  • [4] Complexity of the cover polynomial
    Blaeser, Markus
    Dell, Holger
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 801 - +
  • [5] Approximability and proof complexity
    O'Donnell, Ryan
    Zhou, Yuan
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 1537 - 1556
  • [6] Complexity and Approximability of the Marking Problem
    Valizadeh, M.
    Tadayon, M. H.
    JOURNAL OF MATHEMATICAL EXTENSION, 2021, 15 (01) : 41 - 60
  • [7] Covering with Clubs: Complexity and Approximability
    Dondi, Riccardo
    Mauri, Giancarlo
    Sikora, Florian
    Zoppis, Italo
    COMBINATORIAL ALGORITHMS, IWOCA 2018, 2018, 10979 : 153 - 164
  • [8] On the Approximability of the Vertex Cover and Related Problems
    Han, Qiaoming
    Punnen, Abraham P.
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, 2010, 6124 : 161 - +
  • [9] The Complexity and Approximability of Minimum Contamination Problems
    Li, Angsheng
    Tang, Linqing
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011, 2011, 6648 : 298 - 307
  • [10] Regularity, complexity, and approximability of electronic wavefunctions
    Yserentant, Harry
    Lecture Notes in Computational Science and Engineering, 2014, 102 : 413 - 428
12345