Related references
Note: Only part of the references are listed.REVISITING DECOMPOSITION BY CLIQUE SEPARATORS
David Coudert et al.
SIAM JOURNAL ON DISCRETE MATHEMATICS (2018)
Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem
Betul Ahat et al.
INFORMS JOURNAL ON COMPUTING (2018)
Large Induced Forests in Graphs
Lingsheng Shi et al.
JOURNAL OF GRAPH THEORY (2017)
Exact algorithms for Maximum Induced Matching
Mingyu Xiao et al.
INFORMATION AND COMPUTATION (2017)
Exact algorithms for maximum independent set
Mingyu Xiao et al.
INFORMATION AND COMPUTATION (2017)
Combinatorial algorithm for counting small induced graphs and orbits
Tomaz Hocevar et al.
PLOS ONE (2017)
Induced cycles in triangle graphs
Aparna S. Lakshmanan et al.
DISCRETE APPLIED MATHEMATICS (2016)
Induced Cycles in Graphs
Michael A. Henning et al.
GRAPHS AND COMBINATORICS (2016)
Finding and listing induced paths and cycles
Chinh T. Hoang et al.
DISCRETE APPLIED MATHEMATICS (2013)
A tutorial on branch and cut algorithms for the maximum stable set problem
Steffen Rebennack et al.
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH (2012)
Finding induced trees
N. Derhy et al.
DISCRETE APPLIED MATHEMATICS (2009)
On the Cycle Polytope of a Directed Graph and Its Relaxations
Egon Balas et al.
NETWORKS (2009)
Induced forests in regular graphs with large girth
Carlos Hoppen et al.
COMBINATORICS PROBABILITY & COMPUTING (2008)
A fast algorithm for the maximum clique problem
PRJ Östergård
DISCRETE APPLIED MATHEMATICS (2002)
Algorithms for maximum weight induced paths
F Gavril
INFORMATION PROCESSING LETTERS (2002)
A branch and cut approach to the cardinality constrained circuit problem
P Bauer et al.
MATHEMATICAL PROGRAMMING (2002)
Large induced forests in sparse graphs
N Alon et al.
JOURNAL OF GRAPH THEORY (2001)
Conflict graphs in solving integer programming problems
A Atamtürk et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2000)
Share Paper
