Vertex splitting and connectivity augmentation in hypergraphs
We consider problems of splitting and connectivity augmentation in hypergraphs. In a hypergraph G = (V +s, E), to split two edges su, sv, is to replace them with a single edge uv. We are interested in doing this in such a way as to preserve a defined level of connectivity in V . The splitting techni...
| Main Author: | |
|---|---|
| Published: |
Goldsmiths College (University of London)
2000
|
| Subjects: | |
| Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.272126 |