Two NP-Complete Augmentation Problems

Authors:
Tibor Jordan
Affiliations:
-
Venue:
Two NP-Complete Augmentation Problems
Year:
1997

Citing 0
Cited 4

Edge-connectivity augmentation with partition constraints

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The (sigma+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Covering Directed Graphs by In-Trees

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Covering directed graphs by in-trees

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that the Simplicity Preserving Edge-Connectivity Augmentation Problem and the problem of Increasing Edge-Connectivity by Reinforcing Edges are NP-complete.