Exact Solution Algorithms for the Chordless Cycle Problem
From MaRDI portal
Recommendations
- Exact algorithms for the Hamiltonian cycle problem in planar graphs
- scientific article; zbMATH DE number 7310231
- Exact and heuristic algorithms for solving the discrete Weber problem for a simple cycle
- Exact algorithms for finding longest cycles in claw-free graphs
- Algorithms for shortest paths and d-cycle problems
- Efficient algorithms for minimal disjoint path problems on chordal graphs
- Exact algorithms for difficult graph problems
- An approximation algorithm for the longest cycle problem in solid grid graphs
- An exact algorithm for the period routing problem
Cites work
- A branch and cut approach to the cardinality constrained circuit problem.
- A fast algorithm for the maximum clique problem
- A matrix characterization of induced paths in bridge graphs
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Algorithm 457: finding all cliques of an undirected graph
- Algorithms for finding an induced cycle in planar graphs and bounded genus graphs
- Algorithms for maximum weight induced paths
- An algorithm for the longest cycle problem
- An exact algorithm for the maximum stable set problem
- An extended formulation approach to the edge-weighted maximal clique problem
- Conflict graphs in solving integer programming problems
- Corrigendum to: On the complexity of testing for odd holes and induced odd paths
- Exact algorithms for maximum independent set
- Exact algorithms for maximum induced matching
- Exact Computation of Maximum Induced Forest
- Finding and listing induced paths and cycles
- Finding induced trees
- Greedy randomized adaptive search procedures
- scientific article; zbMATH DE number 1002021 (Why is no real title available?)
- scientific article; zbMATH DE number 1511711 (Why is no real title available?)
- scientific article; zbMATH DE number 1517142 (Why is no real title available?)
- Induced cycles in graphs
- Induced cycles in triangle graphs
- Induced Forests in Regular Graphs with Large Girth
- Induced matchings
- Induced paths in 5-connected graphs
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem
- Large induced forests in graphs
- Large induced forests in sparse graphs
- Maximal induced paths and minimal percolating sets in hypercubes
- Maximum induced matchings in graphs
- Maximum induced trees in graphs
- On induced paths, holes and trees in random graphs
- On the complexity of testing for odd holes and induced odd paths
- On the cycle polytope of a directed graph and its relaxations
- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
- Revisiting decomposition by clique separators
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The Circuit Polytope: Facets
- The maximum clique problem
- The three-in-a-tree problem
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(5)- MIP formulations for induced graph optimization problems: a tutorial
- Exact methods for the longest induced cycle problem
- Semidefinite programming bounds and a branch-and-bound algorithm for the chordless cycle problem
- Formulations and algorithms for the simple cycle problem
- Quadratically constrained reformulation, strong semidefinite programming bounds, and algorithms for the chordless cycle problem
This page was built for publication: Exact Solution Algorithms for the Chordless Cycle Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5106395)
