Decomposing a graph into expanding subgraphs

DOI10.1137/1.9781611973730.85MaRDI QIDQ6829536zbMATH OpenFDO

Authors Guy Moshkovitz, Asaf Shapira

Publication date 5 October 2017

Published in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph designs and isomorphic decomposition (05C51) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: Decomposing a graph into expanding subgraphs

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