A linear-time algorithm for the identifying code problem on block graphs (Q2413180): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2017.10.043 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2767202676 / rank | |||
Normal rank | |||
Revision as of 21:23, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-time algorithm for the identifying code problem on block graphs |
scientific article |
Statements
A linear-time algorithm for the identifying code problem on block graphs (English)
0 references
9 April 2018
0 references
identifying codes
0 references
block graphs
0 references
computational complexity
0 references
