Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Hypergraph connectivity augmentation

From MaRDI portal
Publication:1300056
Jump to:navigation, search

DOI10.1007/s101070050036zbMath0927.05061OpenAlexW2065331695MaRDI QIDQ1300056

Zoltán Szigeti

Publication date: 5 December 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070050036


zbMATH Keywords

hypergraphgreedy algorithmconnectivity augmentationsupermodular colouringskew-supermodular function


Mathematics Subject Classification ID

Hypergraphs (05C65)


Related Items (9)

Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs ⋮ Covering symmetric supermodular functions by uniform hypergraphs ⋮ The Generalized Terminal Backup Problem ⋮ A New Approach to Splitting-Off ⋮ A Survey on Covering Supermodular Functions ⋮ Edge-Connectivity Augmentations of Graphs and Hypergraphs ⋮ A unifying approach to splitting-off ⋮ Local edge-connectivity augmentation in hypergraphs is NP-complete ⋮ Covering skew-supermodular functions by hypergraphs of minimum total size




This page was built for publication: Hypergraph connectivity augmentation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1300056&oldid=13408125"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 11:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki