A new approach to network decomposition problems

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

Authors: 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

Recommendations

• Symmetric-acyclic decompositions of networks
• scientific article; zbMATH DE number 4211746
• scientific article; zbMATH DE number 617925
• Optimal Decomposition of Large-Scale Networks
• scientific article; zbMATH DE number 3922709

Mathematics Subject Classification ID

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

Cited In (7)

• Network Reconstruction – A New Approach to the Traveling Salesman Problem and Complexity
• Some LCP decompositions of multistage interconnection networks
• Fast network decomposition
• A novel decomposition and coordination algorithm for complex networks and its application to power grids
• A new technique for the link slice problem
• Title not available (Why is that?)
• Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement

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)