The Real Positive Semidefinite Completion Problem for Series-Parallel Graphs

Linear Algebra and Its Applications - Netherlands
doi 10.1016/0024-3795(95)00741-5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Positive Semidefinite Matrix Completions on Chordal Graphs and Constraint Nondegeneracy in Semidefinite Programming

Linear Algebra and Its Applications
Numerical AnalysisAlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTopology
2009English

Solution of Symmetric Positive Semidefinite Procrustes Problem

Electronic Journal of Linear Algebra
Number TheoryAlgebra
2019English

The St-Bond Polytope on Series-Parallel Graphs

RAIRO - Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchTheoretical Computer Science
2018English

Parallel Minimum Spanning Tree Heuristic for the Steiner Problem in Graphs

2007English

An Exact Extended Formulation for the Unrelated Parallel Machine Total Weighted Completion Time Problem

Journal of Scheduling
Management ScienceEngineeringOperations ResearchArtificial IntelligenceSoftware
2016English

Preprocessing Sparse Semidefinite Programs via Matrix Completion

Optimization Methods and Software
ControlApplied MathematicsOptimizationSoftware
2006English

Straight-Line Monotone Grid Drawings of Series–parallel Graphs

Discrete Mathematics, Algorithms and Applications
CombinatoricsDiscrete Mathematics
2015English

Low-Rank Semidefinite Programming for the MAX2SAT Problem

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

Inference on Graphs via Semidefinite Programming

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

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy