Approximating long cycle above Dirac's guarantee
From MaRDI portal
Cites work
- Algorithmic extensions of Dirac's theorem
- An approximation algorithm for finding long paths in Hamiltonian graphs
- Analysis and design of algorithms for combinatorial problems. (A selected collection of papers based on the Workshop Analysis and design of algorithms for combinatorial problems, held at CISM, Udine, Italy, September 1982)
- Approximating Longest Cycles in Graphs with Bounded Degrees
- Approximating the Longest Cycle Problem in Sparse Graphs
- Approximating the Minimum-Degree Steiner Tree to within One of Optimal
- Automata, Languages and Programming
- Color-coding
- Determinant sums for undirected Hamiltonicity
- Efficient computation of representative families with applications in parameterized and exact algorithms
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
- Faster Algebraic Algorithms for Path and Packing Problems
- Faster parameterized algorithms using linear programming
- Finding a long directed cycle
- Finding a Path of Superlogarithmic Length
- Finding detours is fixed-parameter tractable
- Finding large cycles in Hamiltonian graphs
- Finding Long Paths, Cycles and Circuits
- Finding Paths and Cycles of Superpolylogarithmic Length
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Going far from degeneracy
- Graph minors. XIII: The disjoint paths problem
- Graph theory
- Hamiltonicity below Dirac's condition
- scientific article; zbMATH DE number 1787231 (Why is no real title available?)
- scientific article; zbMATH DE number 863469 (Why is no real title available?)
- scientific article; zbMATH DE number 863492 (Why is no real title available?)
- scientific article; zbMATH DE number 7595810 (Why is no real title available?)
- scientific article; zbMATH DE number 6297727 (Why is no real title available?)
- Multiplicative Parameterization Above a Guarantee
- On approximating the longest path in a graph
- On Linear Time Minor Tests with Depth-First Search
- On maximal paths and circuits of graphs
- On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
- Parameterized algorithms
- Parameterized traveling salesman problem: beating the average
- Parameterizing above or below guaranteed values
- Polynomial kernels for -extendible properties parameterized above the Poljak-Turzík bound
- Raising the bar for \textsc{Vertex Cover}: fixed-parameter tractability above a higher guarantee
- Some Extremal Properties of Bipartite Subgraphs
- Some Theorems on Abstract Graphs
- The complexity of König subgraph problems and above-guarantee vertex cover
- The linear arrangement problem parameterized above guaranteed value
- Vertex cover problem parameterized above and below tight bounds
- Which problems have strongly exponential complexity?
This page was built for publication: Approximating long cycle above Dirac's guarantee
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586667)
