Complexity results for identifying codes in planar graphs
Year of publication: |
2010
|
---|---|
Authors: | Auger, David ; Charon, Irène ; Hudry, Olivier ; Lobstein, Antoine |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 17.2010, 6, p. 691-710
|
Subject: | Graphentheorie | Graph theory |
-
Durugbo, Christopher, (2013)
-
Simplifying the input-output analysis through the use of topological graphs
Fedriani, Eugenio M., (2012)
-
SinkRank : an algorithm for identifying systemically important banks in payment systems
Soramäki, Kimmo, (2013)
- More ...
-
Some rainbow problems in graphs have complexity equivalent to satisfiability problems
Hudry, Olivier, (2020)
-
Some rainbow problems in graphs have complexity equivalent to satisfiability problems
Hudry, Olivier, (2022)
-
Belgacem, Lucile, (2014)
- More ...