A New Approach to Network Decomposition Problems

DOI10.1007/978-3-319-56829-4_10zbMATH Open1380.90273OpenAlexW2656419701MaRDI QIDQ3133364

Alexander Rubchinsky

Publication date: 14 February 2018

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56829-4_10

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Some LCP decompositions of multistage interconnection networks ⋮ A novel decomposition and coordination algorithm for complex networks and its application to power grids ⋮ Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement ⋮ Title not available (Why is that?) ⋮ A new technique for the link slice problem

This page was built for publication: A New Approach to Network Decomposition Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133364)