Computing the inverse geodesic length in planar graphs and graphs of bounded treewidth.

Published in: CoRR (2019)

Keyphrases

bounded treewidth
planar graphs
np complete
max cut
decision problems
conjunctive queries
boolean functions
minimum weight
relational learning
np hard
graph theoretic
monadic datalog
prior knowledge
undirected graph
approximate inference
phase transition
belief propagation
data integration
shortest path
data model