Pages that link to "Item:Q2357777"
From MaRDI portal
The following pages link to On the complexity of the identifiable subgraph problem, revisited (Q2357777):
Displaying 8 items.
- Random subgraphs make identification affordable (Q501982) (← links)
- The complexity of regular subgraph recognition (Q912615) (← links)
- An optimal lower bound on the number of variables for graph identification (Q1204528) (← links)
- A probabilistic upper bound for the edge identification complexity of graphs (Q1322293) (← links)
- Resilience and optimization of identifiable bipartite graphs (Q1941385) (← links)
- On the complexity of the identifiable subgraph problem (Q2255039) (← links)
- On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths (Q2876554) (← links)
- On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs (Q5009472) (← links)