On the complexity of the identifiable subgraph problem, revisited (Q2357777)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6730833
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the identifiable subgraph problem, revisited |
scientific article; zbMATH DE number 6730833 |
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
0.9037964940071106
0 references
0.8168338537216187
0 references
0.7388550639152527
0 references
0.7269809246063232
0 references
