Triangle-free graphs and completely positive matrices
From MaRDI portal
Publication:2155141
DOI10.1007/S10100-021-00750-9OpenAlexW3158654568MaRDI QIDQ2155141FDOQ2155141
Authors: A. Berman, Naomi Shaked-Monderer 
Publication date: 15 July 2022
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-021-00750-9
Factorization of matrices (15A23) Positive matrices and their generalizations; cones of matrices (15B48) Operations research and management science (90Bxx)
Cites Work
- Spectra of graphs
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Combinatorial results on completely positive matrices
- On copositive matrices with -1, 9, 1 entries
- On the Matrix Equation X′X = A
- Title not available (Why is that?)
- Characterization of completely positive graphs
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs
- Completely positive matrices associated withM-matrices
- Copositive optimization -- recent developments and applications
- Zero-one completely positive matrices and the \(\mathcal A(R, S)\) classes
- From seven to eleven: completely positive matrices with high cp-rank
- Remarks on completey positive matrices
- Copositive and Completely Positive Matrices
- On the number of CP factorizations of a completely positive matrix
- Rational factorizations of completely positive matrices
- Integer completely positive matrices of order two
Cited In (5)
This page was built for publication: Triangle-free graphs and completely positive matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2155141)
