On the complexity of the identifiable subgraph problem (Q2255039): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:27, 5 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
