1 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.DS2021★ 1 cited
Efficient diagonalization of symmetric matrices associated with graphs of small treewidth
Martin Fürer, Carlos Hoppen, Vilmar Trevisan
Let be a symmetric matrix of order whose elements lie in an arbitrary field , and let be the graph with vertex set such that disti…
cs.DS2014★ 1 cited
Counting cliques and clique covers in random graphs
Kashyap Dixit, Martin Fürer
We study the problem of counting the number of {\em isomorphic} copies of a given {\em template} graph, say , in the input {\em base} graph, say . In general, it is believed…
cs.DS2014★ 1 cited
Space Saving by Dynamic Algebraization
Martin Furer, Huiwen Yu
Dynamic programming is widely used for exact computations based on tree decompositions of graphs. However, the space complexity is usually exponential in the treewidth. We study th…