Edge-augmentation of hypergraphs (Q1300051): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s101070050032 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s101070050032 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982406315 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S101070050032 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:44, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge-augmentation of hypergraphs |
scientific article |
Statements
Edge-augmentation of hypergraphs (English)
0 references
27 February 2000
0 references
The edge-augmentation problem is to find a smallest set of edges (of size two) to add to a hypergraph such that the edge-connectivity increases by one. Based on a result by \textit{W. H. Cunningham} [Combinatorica 3, 53-68 (1983; Zbl 0518.05059)], the author constructs a polynomial time algorithm computing such a smallest set and he proves a min-max relation for its cardinality.
0 references
edge-connectivity
0 references
hypergraph
0 references
split decomposition
0 references
algorithm
0 references
