38 citations · 99 across the 20 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.CC2022
Weighted Counting of Matchings in Unbounded-Treewidth Graph Families
Antoine Amarilli, Mikaël Monet
We consider a weighted counting problem on matchings, denoted , on an arbitrary fixed graph family . The input consists of a graph $G…
cs.DB2022
Computing the Shapley Value of Facts in Query Answering
Daniel Deutch, Nave Frost, Benny Kimelfeld +1
The Shapley value is a game-theoretic notion for wealth distribution that is nowadays extensively used to explain complex data-intensive computation, for instance, in network analy…