Applications of the Inverse Theta Number in Stable Set Problems
DOI10.14232/ACTACYB.21.3.2014.12zbMATH Open1313.05189OpenAlexW2402843908MaRDI QIDQ2937553FDOQ2937553
Authors: Miklós Ujvári 
Publication date: 9 January 2015
Published in: Acta Cybernetica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.14232/actacyb.21.3.2014.12
Recommendations
- The 0-1 inverse maximum stable set problem
- Bounds on the stability number of a graph via the inverse theta function
- scientific article
- Publication:4885363
- scientific article; zbMATH DE number 7377839
- The inverse problem on subset sums
- The solution of generalized stable sets and its refinement
- An inverse problem for finite Sidon sets
- A general theorem on inversion problems for polynomial sets
- scientific article; zbMATH DE number 3961619
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Semidefinite programming (90C22) Extremal problems in graph theory (05C35)
Cited In (5)
- A heuristic for the stability number of a graph based on convex quadratic programming and tabu search
- Bounds on the stability number of a graph via the inverse theta function
- Title not available (Why is that?)
- Maximum stable set formulations and heuristics based on continuous optimization
- The travelling preacher, projection, and a lower bound for the stability number of a graph
This page was built for publication: Applications of the Inverse Theta Number in Stable Set Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2937553)
