The Euclidean distance completion problem: cycle completability

DOI10.1080/03081089508818392MaRDI QIDQ4853938zbMATH OpenOpenAlexFDO

Authors Charles R. Johnson, Catherine A. Jones, Brenda K. Kroschel

Publication date 20 February 1996

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081089508818392

zbMATH Keywords

cycle completabilitycyclesEuclidean distance matrix completion problempartial distance matrixpartial symmetric matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Hermitian, skew-Hermitian, and related matrices (15B57)

Recommendations

• The Euclidian Distance Matrix Completion Problem
• Approximation of Euclidean \(k\)-size cycle cover problem
• Euclidean distance matrix completion problems
• scientific article; zbMATH DE number 4070353
• A cycle-based formulation for the distance geometry problem
• Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
• A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph
• The cycle embedding problem
• Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree
• On the uniqueness of Euclidean distance matrix completions.

Cites work

• Connections between the real positive semidefinite and distance matrix completion problems
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3331438 (Why is no real title available?)
• Positive definite completions of partial Hermitian matrices
• The real positive definite completion problem for a simple cycle

Cited in

(10)

• Structural conditions for cycle completable graphs
• The symmetric inverse M-matrix completion problem
• Cuts, matrix completions and graph rigidity
• A connection between positive semidefinite and Euclidean distance matrix completion problems
• On the uniqueness of Euclidean distance matrix completions.
• On the uniqueness of Euclidean distance matrix completions: the case of points in general position
• Connections between the real positive semidefinite and distance matrix completion problems
• On a relationship between graph realizability and distance matrix completion
• The Euclidian Distance Matrix Completion Problem
• Characterizing and generalizing cycle completable graphs

This page was built for publication: The Euclidean distance completion problem: cycle completability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4853938)