On the complexity of the identifiable subgraph problem, revisited (Q2357777)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the identifiable subgraph problem, revisited |
scientific article |
Statements
On the complexity of the identifiable subgraph problem, revisited (English)
0 references
14 June 2017
0 references
bipartite graph
0 references
matching
0 references
identifiable graph
0 references
computational complexity
0 references
polynomial time algorithm
0 references
\(\mathsf{W} [1]\)-hardness
0 references
