Pages that link to "Item:Q5710817"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5710817):
Displaying 6 items.
- Local edge-connectivity augmentation in hypergraphs is NP-complete (Q968204) (← links)
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788) (← links)
- Maximum algebraic connectivity augmentation is NP-hard (Q2517792) (← links)
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (Q3057155) (← links)
- (Q4250196) (← links)
- Edge-Connectivity Augmentation with Partition Constraints (Q4255815) (← links)