Sciweavers

Share
42 search results - page 1 / 9
» Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs
Sort
View
WG
2009
Springer
10 years 5 months ago
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Dan...
STACS
2016
Springer
4 years 6 months ago
The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree
We consider the complexity of the Hamilton cycle decision problem when restricted to k-uniform hypergraphs H of high minimum codegree δ(H). We show that for tight Hamilton cycles...
Frederik Garbe, Richard Mycroft
DAC
1999
ACM
10 years 11 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...
AUSSOIS
2001
Springer
10 years 3 months ago
Exact Algorithms for NP-Hard Problems: A Survey
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
Gerhard J. Woeginger
COCOON
2007
Springer
10 years 2 months ago
Improved Exact Algorithms for Counting 3- and 4-Colorings
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh
books