Pages that link to "Item:Q2827765"
From MaRDI portal
The following pages link to Optimal partial discretization orders for discretizable distance geometry (Q2827765):
Displayed 7 items.
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures (Q1730533) (← links)
- The referenced vertex ordering problem: theory, applications, and solution methods (Q2165588) (← links)
- A least-squares approach for discretizable distance geometry problems with inexact distances (Q2174885) (← links)
- An integer programming approach for the search of discretization orders in distance geometry problems (Q2174886) (← links)
- The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry (Q2174889) (← links)
- Constraint programming approaches for the discretizable molecular distance geometry problem (Q6065908) (← links)
- On distance graph coloring problems (Q6070499) (← links)