Searching for spreads and packings
From MaRDI portal
Publication:2573120
DOI10.1007/s11227-005-1168-0zbMath1130.68340OpenAlexW2051218676MaRDI QIDQ2573120
Paulius Micikevicius, Narsingh Deo
Publication date: 7 November 2005
Published in: The Journal of Supercomputing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11227-005-1168-0
Uses Software
Cites Work
- A note on two problems in connexion with graphs
- The theory and practice of distance geometry
- A distance geometry program for determining the structures of small proteins and other macromolecules from nuclear magnetic resonance measurements of intramolecular \({}^ 1H-^ 1H\) proximities in solution
- Computational experience with a parallel algorithm for tetrangle inequality bound smoothing
- Shortest-path problems and molecular conformation
- Computational experience with an algorithm for tetrangle inequality bound smoothing
- A novel approach to calculation of conformation: Distance geometry
- Optimal packings of \(K_4\)'s into a \(K_n\)
- Partitions of the 4-subsets of a 13-set into disjoint projective planes
- Parallel Matrix and Graph Algorithms
- Distributed computation on graphs
- The Molecule Problem: Exploiting Structure in Global Optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Searching for spreads and packings
