The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree

被引：0
|
作者：
Bressan, Marco [1 ]
Lanzinger, Matthias [2 ]
Roth, Marc [2 ]
机构：
[1] Department of Computer Science University of Milan Italy, Italy
[2] Department of Computer Science University of Oxford, United Kingdom
来源：
arXiv | 2022年
关键词：
Compilation and indexing terms; Copyright 2024 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
C (programming language) - Constraint satisfaction problems - Graphic methods - Parameter estimation - Parameterization
引用
收藏
相关论文
共 50 条
  • [1] The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree
    Bressan, Marco
    Lanzinger, Matthias
    Roth, Marc
    PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 542 - 552
  • [2] The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree
    Bressan, Marco
    Lanzinger, Matthias
    Roth, Marc
    Proceedings of the Annual ACM Symposium on Theory of Computing, 2023, : 542 - 552
  • [3] Ranking by outdegree for directed graphs
    van den Brink, R
    Gilles, RP
    DISCRETE MATHEMATICS, 2003, 271 (1-3) : 261 - 270
  • [4] The parameterised complexity of counting even and odd induced subgraphs
    Jerrum, Mark
    Meeks, Kitty
    COMBINATORICA, 2017, 37 (05) : 965 - 990
  • [5] The parameterised complexity of counting even and odd induced subgraphs
    Mark Jerrum
    Kitty Meeks
    Combinatorica, 2017, 37 : 965 - 990
  • [6] The parameterised complexity of counting connected subgraphs and graph motifs
    Jerrum, Mark
    Meeks, Kitty
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2015, 81 (04) : 702 - 716
  • [7] The parameterised complexity of list problems on graphs of bounded treewidth
    Meeks, Kitty
    Scott, Alexander
    INFORMATION AND COMPUTATION, 2016, 251 : 91 - 103
  • [8] "Ranking by outdegree for directed graphs" (vol 271, pg 261, 2003)
    Hwang, Yan-An
    You, Ding-Cheng
    DISCRETE MATHEMATICS, 2019, 342 (07) : 2158 - 2160
  • [9] Entanglement and the complexity of directed graphs
    Berwanger, Dietmar
    Graedel, Erich
    Kaiser, Lukasz
    Rabinovich, Roman
    THEORETICAL COMPUTER SCIENCE, 2012, 463 : 2 - 25
  • [10] Parameterised Counting in Logspace
    Haak, Anselm
    Meier, Arne
    Prakash, Om
    Rao, Raghavendra B., V
    38TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2021), 2021, 187
12345