Filtrer vos résultats
- 17
- 12
- 17
- 5
- 4
- 1
- 1
- 1
- 27
- 19
- 1
- 3
- 7
- 2
- 3
- 3
- 2
- 2
- 1
- 1
- 2
- 1
- 1
- 1
- 28
- 1
- 22
- 11
- 6
- 1
- 1
- 1
- 1
- 1
- 29
- 27
- 5
- 4
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 1
29 résultats
|
|
|
triés par
|
On the number of optimal identifying codes in a twin-free graphDiscrete Applied Mathematics, 2015, 180, pp.111-119
Article dans une revue
hal-02286996v1
|
|||
On the Ensemble of Optimal Identifying Codes in a Twin-Free GraphCryptography and Communications - Discrete Structures, Boolean Functions and Sequences, 2016, 8, pp.139-153
Article dans une revue
hal-02287017v1
|
|||
|
|
Unique (Optimal) Solutions: Complexity Results for Identifying and Locating-Dominating CodesTheoretical Computer Science, 2019, 767, pp.83-102. ⟨10.1016/j.tcs.2018.09.034⟩
Article dans une revue
hal-01884809v1
|
||
|
|
Some Results About a Conjecture on Identifying Codes in Complete SunsInternational Transactions in Operational Research, 2019, 26 (2), pp.732-746
Article dans une revue
hal-01613344v1
|
||
|
|
Watching systems in graphs: an extension of identifying codes2010
Pré-publication, Document de travail
hal-00481469v1
|
||
|
|
Maximum Size of a Minimum Watching System and the Graphs Achieving the Bound2012
Pré-publication, Document de travail
hal-00680690v1
|
||
Codes in the q-ary Lee HypercubeWSEAS Transactions on Mathematics, 2022, 21, pp.173-186
Article dans une revue
hal-03650634v1
|
|||
Complexity results on dominating codesThe Second Malta Conference in Graph Theory and Combinatorics, Jun 2017, Qawra, Malta
Communication dans un congrès
hal-02287572v1
|
|||
|
|
On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or PathWSEAS Transactions on Mathematics, 2022, 21, pp.433-446
Article dans une revue
hal-01680709v1
|
||
More Results on the Complexity of Domination Problems in GraphsInternational Journal of Information and Coding Theory, 2017, 4 (2/3), pp.129-144. ⟨10.1504/ijicot.2017.083829⟩
Article dans une revue
hal-01593750v1
|
|||
|
|
Minimum Sizes of Identifying Codes in Graphs Differing by One Edge or One Vertex2012
Pré-publication, Document de travail
hal-00731811v1
|
||
|
|
Taille minimum des codes identifiants dans les graphes différant par un sommet ou une arête2011
Rapport
hal-00623981v1
|
||
|
|
Complexity of Unique (Optimal) Solutions in Graphs: Vertex Cover and DominationJournal of Combinatorial Mathematics and Combinatorial Computing, 2019, 110, pp.217-240
Article dans une revue
hal-01613388v1
|
||
On the Ensemble of Optimal Dominating and Locating-Dominating Codes in a GraphInformation Processing Letters, 2015, 115, pp.699-702
Article dans une revue
hal-02287016v1
|
|||
Dominating, Locating-Dominating and Identifying Codes in the q-ary Lee Hypercube11th International Colloquium on Graph Theory and Combinatorics (ICGT 2022), 2022, Montpellier, France
Communication dans un congrès
hal-03744673v1
|
|||
|
|
Nonatomic Non-Cooperative Neighbourhood Balancing Games2023
Pré-publication, Document de travail
hal-04380503v1
|
||
On the Complexity of the Uniqueness of Solutions in Graph Problems2017
Autre publication scientifique
hal-01613394v1
|
|||
Some Complexity Considerations on the Uniqueness of Graph ColouringWSEAS Transactions on Mathematics, 2023, 22, pp.art. #54, 483-493
Article dans une revue
hal-02287571v1
|
|||
Adaptatif identifying codes.Journal of Combinatorial Theory, Series A, 2008, 115, pp.1114-1126
Article dans une revue
hal-00290416v1
|
|||
On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or PathWSEAS Transactions on Mathematics, 2022, 21, pp.433-446
Article dans une revue
hal-03700181v1
|
|||
|
|
Locating-Domination and IdentificationT. Haynes, S. Hedetniemi & M. Henning. Topics in Domination in Graphs, pp.251-299, 2020
Chapitre d'ouvrage
hal-02916929v1
|
||
|
|
Complexité du problème de l'unicité d'un transversal minimum dans un graphe23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France
Communication dans un congrès
hal-03596176v1
|
||
|
|
Some Rainbow Problems in Graphs Have Complexity Equivalent to Satisfiability ProblemsInternational Transactions in Operational Research, 2022, 29 (3), pp.1547-1572
Article dans une revue
hal-02916921v1
|
||
Some Complexity Considerations on the Uniqueness of Graph ColouringWSEAS Transactions on Mathematics, 2023, 22, pp.483-493
Article dans une revue
hal-04178848v1
|
|||
Complexity of the unicity of an optimal vertex cover in graphsStockholm Optimization Days 2022, Jun 2022, Stockholm, Sweden
Communication dans un congrès
hal-03714746v1
|
|||
|
|
The Compared Costs of Domination, Location-Domination and IdentificationDiscussiones Mathematicae Graph Theory, 2020, 40 (1), pp.127-147. ⟨10.7151/dmgt.2129⟩
Article dans une revue
hal-01702966v1
|
||
More Results on the Complexity of Identifying Problems in GraphsTheoretical Computer Science, 2016, 626, pp.1-12
Article dans une revue
hal-02287134v1
|
|||
Variations of identifying codes in graphs obained by adding or removing one vertex9th International colloquium on graph theory and combinatorics (ICGT 2014), Jul 2014, Grenoble, France. pp.1-4
Communication dans un congrès
hal-02286931v1
|
|||
Minimum Sizes of Identifying Codes in Graphs Differing by One VertexCryptography and Communications - Discrete Structures, Boolean Functions and Sequences, 2013, 5, pp.119-136
Article dans une revue
hal-02286382v1
|