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年

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

C (programming language) - Constraint satisfaction problems - Graphic methods - Parameter estimation - Parameterization

引用