Pages that link to "Item:Q3010400"
From MaRDI portal
The following pages link to How to Cut a Graph into Many Pieces (Q3010400):
Displaying 4 items.
- An integer programming framework for critical elements detection in graphs (Q405684) (← links)
- Critical node detection problem for complex network in undirected weighted networks (Q2164641) (← links)
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth (Q2444525) (← links)
- Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
