Approximating long cycle above Dirac's guarantee

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
Vertex cover problem parameterized above and below tight bounds
The complexity of König subgraph problems and above-guarantee vertex cover
On approximating the longest path in a graph
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)
Finding large cycles in Hamiltonian graphs
Finding paths of length \(k\) in \(O^{*}(2^k)\) time
Parameterizing above or below guaranteed values
Which problems have strongly exponential complexity?
Graph minors. XIII: The disjoint paths problem
Hamiltonicity below Dirac's condition
The linear arrangement problem parameterized above guaranteed value
Graph Theory
Polynomial Kernels for {\lambda}-extendible Properties Parameterized Above the Poljak-Turz\'ik Bound
Approximating the Longest Cycle Problem in Sparse Graphs
Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
On maximal paths and circuits of graphs
Approximating Longest Cycles in Graphs with Bounded Degrees
Faster Algebraic Algorithms for Path and Packing Problems
Finding Long Paths, Cycles and Circuits
On Linear Time Minor Tests with Depth-First Search
On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
Approximating the Minimum-Degree Steiner Tree to within One of Optimal
Color-coding
Finding a Path of Superlogarithmic Length
Raising The Bar For V<scp>ertex</scp> C<scp>over</scp>: Fixed-parameter Tractability Above A Higher Guarantee
An approximation algorithm for finding long paths in Hamiltonian graphs
Faster Parameterized Algorithms Using Linear Programming
Finding a long directed cycle
Finding Detours is Fixed-Parameter Tractable
Going Far from Degeneracy
Determinant Sums for Undirected Hamiltonicity
Finding Paths and Cycles of Superpolylogarithmic Length
Automata, Languages and Programming
Parameterized Algorithms
Some Extremal Properties of Bipartite Subgraphs
Parameterized Traveling Salesman Problem: Beating the Average
Some Theorems on Abstract Graphs
Multiplicative Parameterization Above a Guarantee
Algorithmic extensions of Dirac's theorem

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)