Publication | Closed Access

On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem

Mathematical ProgrammingBranch-and-bound AlgorithmMaximum Clique ProblemGraph TheoryEngineeringExtremal Graph TheoryCombinatory AnalysisCombinatorial ProblemNetwork AnalysisEducationComputational ComplexityBranch-and-bound AlgorithmsExtremal CombinatoricsComputer ScienceDiscrete MathematicsCombinatorial OptimizationBranch And Bound