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

Edge-augmentation of hypergraphs

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

DOI10.1007/s101070050032zbMath0932.05067OpenAlexW1982406315MaRDI QIDQ1300051

Eddie Cheng

Publication date: 27 February 2000

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

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


zbMATH Keywords

algorithmhypergraphedge-connectivitysplit decomposition


Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)


Related Items (6)

Unnamed Item ⋮ Minimum Cuts and Sparsification in Hypergraphs ⋮ Covering symmetric supermodular functions by uniform hypergraphs ⋮ Maximally edge-connected hypergraphs ⋮ Edge-connectivity in hypergraphs ⋮ Sufficient conditions for hypergraphs to be maximally edge-connected







This page was built for publication: Edge-augmentation of hypergraphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1300051&oldid=13408117"
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