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 |
-
Connectedness between G10 currencies : searching for the causal structure
Bettendorf, Timo, (2023)
-
Cheng, Ying, (2023)
-
Exploratory analysis of grocery product networks
Hsieh, Ping-hung, (2022)
- 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 ...