Counting the Number of Solutions of KDMDGP Instances

DOI10.1007/978-3-642-40020-9_23zbMath1405.05083OpenAlexW45233470WikidataQ62562152 ScholiaQ62562152MaRDI QIDQ5410537

Leo Liberti, Germano Abud, Jorge Alencar, Carlile C. Lavor

Publication date: 16 April 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-642-40020-9_23

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Signed and weighted graphs (05C22)

Related Items

Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem, Distance geometry and data science, Cycle-based formulations in distance geometry, Distance Geometry on the Sphere, Equivalent realisations of a rigid graph, Minimal NMR distance information for rigidity of protein graphs, Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures, Discretization vertex orders in distance geometry, On the optimality of finding DMDGP symmetries, New error measures and methods for realizing protein graphs from distance data, A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances, A cycle-based formulation for the distance geometry problem, On the polynomiality of finding \(^K\text{DMDGP}\) re-orders, A quantum approach to the discretizable molecular distance geometry problem