Skip to content

Optimization Online

  • Welcome
  • Repository
  • Submit
  • About
  • Help
  • My Eprints

An Algorithm to Determine the Clique Number of a Split Graph

Published: 2008/01/10, Updated: 2008/01/30
  • Omar Kettani
Categories Graphs and Matroids Tags clique number, split graph Short URL: https://optimization-online.org/?p=10338

In this paper, we propose an algorithm to determine the clique number of a split graph.

Article

Download

View PDF

Test instances for the traffic assignment problem
The Maximum Flow Network Interdiction Problem: Valid Inequalities, Integrality Gaps, and Approximability
Log in

Repository

Author List

Months

Categories

Keywords

alternating direction method of multipliers augmented lagrangian method benders decomposition bilevel optimization Branch-and-Bound branch-and-cut chance constraints column generation combinatorial optimization complexity constrained optimization convex optimization cutting planes decomposition derivative-free optimization distributionally robust optimization duality dynamic programming first-order methods global convergence global optimization heuristics integer programming interior point methods large-scale optimization linear programming machine learning mixed-integer linear programming mixed-integer nonlinear programming mixed-integer programming multiobjective optimization nonconvex optimization nonlinear optimization nonlinear programming nonsmooth optimization optimal control optimization proximal point algorithm quadratic programming robust optimization semidefinite programming stochastic optimization stochastic programming trust-region methods unconstrained optimization

© 2026 Optimization Online • Child Theme of GeneratePress
For feedback or questions, contact optonline@wid.wisc.edu.