Faster exponential-time algorithms in graphs of bounded average degree
- 1 August 2015
- journal article
- Published by Elsevier in Information and Computation
- Vol. 243, 75-85
Abstract
No abstract availableAll Related Versions
Funding Information
- NCN (N206567140)
- Foundation For Polish Science
This publication has 11 references indexed in Scilit:
- The traveling salesman problem in bounded degree graphsACM Transactions on Algorithms, 2012
- Evaluation of permanents in rings and semiringsInformation Processing Letters, 2010
- Trimmed Moebius Inversion and Graphs of Bounded DegreeTheory of Computing Systems, 2009
- Set Partitioning via Inclusion-ExclusionSIAM Journal on Computing, 2009
- Exact Algorithms for Exact Satisfiability and Number of Perfect MatchingsAlgorithmica, 2007
- Computing sparse permanents fasterInformation Processing Letters, 2005
- A Permanent Algorithm with exp[Ω (n ^{1/3}/2 ln n )] Expected Speedup for 0-1 MatricesAlgorithmica, 2002
- On the Complexity of k-SATJournal of Computer and System Sciences, 2001
- A Dynamic Programming Approach to Sequencing ProblemsJournal of the Society for Industrial and Applied Mathematics, 1962
- Dynamic Programming Treatment of the Travelling Salesman ProblemJournal of the ACM, 1962