The Gram Dimension of a Graph

DOI10.1007/978-3-642-32147-4_32zbMath1370.05196arXiv1112.5960OpenAlexW2138463807MaRDI QIDQ3167639

Antonios Varvitsiotis, Monique Laurent

Publication date: 2 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.5960

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph minors (05C83) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

Maximum likelihood threshold and generic completion rank of graphs ⋮ Positive semidefinite matrix completion, universal rigidity and the strong Arnold property ⋮ A new graph parameter related to bounded rank positive semidefinite matrix completions ⋮ Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint ⋮ Selected Open Problems in Discrete Geometry and Optimization ⋮ Iterative universal rigidity

This page was built for publication: The Gram Dimension of a Graph