Some rainbow problems in graphs have complexity equivalent to satisfiability problems
Year of publication: |
2022
|
---|---|
Authors: | Hudry, Olivier ; Lobstein, Antoine |
Published in: |
International transactions in operational research : a journal of the International Federation of Operational Research Societies. - Oxford : Wiley-Blackwell, ISSN 1475-3995, ZDB-ID 2019815-2. - Vol. 29.2022, 3, p. 1547-1572
|
Subject: | complexity theory | dominating codes | graph theory | identifying codes | locating-dominating codes | rainbow sets | twin-free graphs | uniqueness of solution | Graphentheorie | Graph theory | Komplexe Systeme | Complex systems |
-
Understanding voting behaviour in complex political systems
Lapatinas, Athanasios, (2014)
-
Convergence of European business cycles : a complex networks approach
Papadimitriou, Theophilos, (2016)
-
The convergence evolution in Europe from a complex networks perspective
Papadimitriou, Theophilos, (2022)
- More ...
-
Some rainbow problems in graphs have complexity equivalent to satisfiability problems
Hudry, Olivier, (2020)
-
Complexity results for identifying codes in planar graphs
Auger, David, (2010)
-
Monjardet, Bernard, (2009)
- More ...