Exact exponential algorithms
Exact exponential algorithms Page 1 80 coMMunicATions of ThE AcM | MARCh 2013 | Vol. 56
| No. 3 review articles Exact Exponential Algorithms of non-parameterized instances of intractable …
| No. 3 review articles Exact Exponential Algorithms of non-parameterized instances of intractable …
Finding, minimizing, and counting weighted subgraphs
V Vassilevska, R Williams - Proceedings of the forty-first annual ACM …, 2009 - dl.acm.org
For a pattern graph H on k nodes, we consider the problems of finding and counting the
number of (not necessarily induced) copies of H in a given large graph G on n nodes, as …
number of (not necessarily induced) copies of H in a given large graph G on n nodes, as …
Limits and applications of group algebras for parameterized problems
I Koutis, R Williams - … : 36th International Colloquium, ICALP 2009, Rhodes …, 2009 - Springer
The algebraic framework introduced in [Koutis, Proc. of the 35 th ICALP 2008] reduces
several combinatorial problems in parameterized complexity to the problem of detecting …
several combinatorial problems in parameterized complexity to the problem of detecting …
LIMITS and applications of group algebras for parameterized problems
I Koutis, R Williams - ACM Transactions on Algorithms (TALG), 2016 - dl.acm.org
The fastest known randomized algorithms for several parameterized problems use
reductions to the k-MlD problem: detection of multilinear monomials of degree k in …
reductions to the k-MlD problem: detection of multilinear monomials of degree k in …
Evaluation of permanents in rings and semirings
A study was conducted to present simple folklore algorithms to evaluate the permanent of a
given matrix. Bellman-Held-Karp type dynamic programming was applied across column …
given matrix. Bellman-Held-Karp type dynamic programming was applied across column …
[PDF][PDF] On evaluation of permanents
arXiv:0904.3251v1 [cs.DS] 21 Apr 2009 Page 1 On evaluation of permanents Andreas
Björklunda, Thore Husfeldta,b, Petteri Kaskic,1, Mikko Koivistoc,1 aLund University, Department …
Björklunda, Thore Husfeldta,b, Petteri Kaskic,1, Mikko Koivistoc,1 aLund University, Department …
Texts in Theoretical Computer Science
AE Series - Springer
Combinatorial mathematics has been pursued since time immemorial, and at a reasonable
scientific level at least since Leonhard Euler (1707–1783). It rendered many services to both …
scientific level at least since Leonhard Euler (1707–1783). It rendered many services to both …
Inclusion-Exclusion
FV Fomin, D Kratsch, FV Fomin, D Kratsch - Exact Exponential Algorithms, 2010 - Springer
Inclusion-exclusion is a fascinating technique used in the design of fast exponential time
algorithms. It is based on the inclusion-exclusion principle which is a fundamental counting …
algorithms. It is based on the inclusion-exclusion principle which is a fundamental counting …