Exact Solution Algorithms for the Chordless Cycle Problem
From MaRDI portal
Publication:5106395
DOI10.1287/ijoc.2022.1164OpenAlexW4220848068MaRDI QIDQ5106395
No author found.
Publication date: 19 September 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2022.1164
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Induced cycles in triangle graphs
- Maximal induced paths and minimal percolating sets in hypercubes
- Induced cycles in graphs
- The three-in-a-tree problem
- Finding induced trees
- Maximum induced trees in graphs
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- On the complexity of testing for odd holes and induced odd paths
- Corrigendum to: On the complexity of testing for odd holes and induced odd paths
- Induced matchings
- An extended formulation approach to the edge-weighted maximal clique problem
- The maximum clique problem
- An exact algorithm for the maximum stable set problem
- Maximum induced matchings in graphs
- Algorithms for maximum weight induced paths
- A fast algorithm for the maximum clique problem
- Greedy randomized adaptive search procedures
- Finding and listing induced paths and cycles
- Conflict graphs in solving integer programming problems
- Exact algorithms for maximum independent set
- Exact algorithms for maximum induced matching
- Induced paths in 5-connected graphs
- Large induced forests in sparse graphs
- On the cycle polytope of a directed graph and its relaxations
- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
- Induced Forests in Regular Graphs with Large Girth
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- An algorithm for the longest cycle problem
- A matrix characterization of induced paths in bridge graphs
- The Circuit Polytope: Facets
- Revisiting Decomposition by Clique Separators
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Large Induced Forests in Graphs
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem
- On Induced Paths, Holes and Trees in Random Graphs
- Algorithm 457: finding all cliques of an undirected graph
- Exact Computation of Maximum Induced Forest
- A branch and cut approach to the cardinality constrained circuit problem.
