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
Discussion
View source
View history
Purge
English
Log in

Degree-Constrained Node-Connectivity

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

DOI10.1007/978-3-642-29344-3_49zbMath1354.05134OpenAlexW1614197999MaRDI QIDQ2894500

Zeev Nutov

Publication date: 29 June 2012

Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29344-3_49



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)


Related Items (3)

On some network design problems with degree constraints ⋮ A unified algorithm for degree bounded survivable network design ⋮ Degree constrained node-connectivity problems







This page was built for publication: Degree-Constrained Node-Connectivity

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