Amanote Research

Amanote Research

  • Register
  • Sign In

Computing the Stability Number of a Graph via Linear and Semidefinite Programming

SIAM Journal on Optimization- United States

doi 10.1137/05064401x

Full Text

Abstract

Available in

Categories

Theoretical Computer ScienceSoftware

Date

January 1, 2007

Authors

Javier PeñaJuan VeraLuis F. Zuluaga

Publisher

Society for Industrial & Applied Mathematics (SIAM)


Related search

Linear Index Coding via Semidefinite Programming

2012English

A Subspace Semidefinite Programming for Spectral Graph Partitioning

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Inference on Graphs via Semidefinite Programming

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
2016English

Generalized Chebyshev Bounds via Semidefinite Programming

SIAM Review
Computational MathematicsApplied MathematicsTheoretical Computer Science
2007English

Sdpt3r: Semidefinite Quadratic Linear Programming in R

R Journal
UncertaintyNumerical AnalysisStatisticsProbability
2019Italian

Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming

Journal of Siberian Federal University - Mathematics and Physics
MathematicsAstronomyPhysics
2018English

Semidefinite Programming Formulation of Linear-Scaling Electronic Structure Theories

Physical Review A
2015English

Semidefinite Programming

2014English

Semidefinite Programming

SIAM Review
Computational MathematicsApplied MathematicsTheoretical Computer Science
1996English

Amanote Research

Note-taking for researchers

Follow Amanote


© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy