The complexity of approximating averages on bounded-degree graphs.

Andreas Galanis Daniel Stefankovic Eric Vigoda

Published in: CoRR (2020)

Keyphrases

bounded degree
bounded treewidth
graph theoretic
computational complexity
decision problems
graph matching
domain knowledge
directed graph
graph theory
space complexity
undirected graph
relational learning