Counting the Number of Solutions of KDMDGP Instances

DOI10.1007/978-3-642-40020-9_23MaRDI QIDQ5410537zbMATH OpenOpenAlexWikidataFDO

Authors Leo Liberti, Jorge Alencar, Germano Abud, Carlile 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

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

Cited in

(16)

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

This page was built for publication: Counting the Number of Solutions of KDMDGP Instances

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