The Referenced Vertex Ordering Problem: Theory, Applications, and Solution Methods
We introduce the referenced vertex ordering problem (revorder) as a combinatorial decision problem generalizing several vertex ordering problems that already appeared in the scientific literature under different guises. In other words, revorder is a generic problem with several possible extensions c...
Saved in:
Main Authors: | Omer, Jérémy, Mucherino, Antonio |
---|---|
Format: | Article |
Language: | English |
Published: |
Université de Montpellier
2021-08-01
|
Series: | Open Journal of Mathematical Optimization |
Subjects: | |
Online Access: | https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.8/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
THE VERTEX DISTANCE COMPLEMENT SPECTRUM OF SUBDIVISION VERTEX JOIN AND SUBDIVISION EDGE JOIN OF TWO REGULAR GRAPHS
by: Ann Susa Thomas, et al.
Published: (2021-07-01) -
ON SOME VERTEX-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS
by: Ludmila Yu. Tsiovkina
Published: (2022-12-01) -
ON \(G\)-VERTEX-TRANSITIVE COVERS OF COMPLETE GRAPHS HAVING AT MOST TWO \(G\)-ORBITS ON THE ARC SET
by: Ludmila Yu. Tsiovkina
Published: (2024-07-01) -
Vertex–Edge Roman {2}-Domination
by: Ahlam Almulhim, et al.
Published: (2025-07-01) -
Distinctive LMI Formulations for Admissibility and Stabilization Algorithms of Singular Fractional-Order Systems with Order Less than One
by: Xinhai Wang, et al.
Published: (2025-07-01)