On the complexity of the identifiable subgraph problem (Q2255039): 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.dam.2014.10.021 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2022237586 / rank | |||
Normal rank | |||
Revision as of 22:56, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the identifiable subgraph problem |
scientific article |
Statements
On the complexity of the identifiable subgraph problem (English)
0 references
6 February 2015
0 references
bipartite graph
0 references
matching
0 references
identifiable graph
0 references
topological minor
0 references
strongly cyclic graph
0 references
polynomial algorithm
0 references
