Vertex ordering with optimal number of adjacent predecessors

DOI10.23638/DMTCS-22-1-1zbMath1450.05015OpenAlexW3013102369MaRDI QIDQ5130732

Jérémy Omer, Tangi Migot

Publication date: 28 October 2020

Full work available at URL: https://hal.science/hal-02025298

zbMATH Keywords

complexity analysisvertex orderingdiscretization orderdistance geometry problem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items (2)

The referenced vertex ordering problem: theory, applications, and solution methods ⋮ Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems

This page was built for publication: Vertex ordering with optimal number of adjacent predecessors