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

Optimal Mixed Graph Augmentation

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

DOI10.1137/0216041zbMath0624.05043OpenAlexW2003227017MaRDI QIDQ3762349

Dan Gusfield

Publication date: 1987

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0216041


zbMATH Keywords

strong connectivitymixed graphsgraph orientationaugmentation problem


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)


Related Items (3)

Optimal bi-level augmentation for selective! enhancing graph connectivity with applications ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ Optimal augmentation for bipartite componentwise biconnectivity in linear time







This page was built for publication: Optimal Mixed Graph Augmentation

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