A comparison of approaches for finding minimum identifying codes on graphs (Q296102)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A comparison of approaches for finding minimum identifying codes on graphs |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A comparison of approaches for finding minimum identifying codes on graphs |
scientific article |
Statements
A comparison of approaches for finding minimum identifying codes on graphs (English)
0 references
14 June 2016
0 references
graph theory
0 references
SMT solvers
0 references
quantum annealing
0 references
0 references