Publisher
Springer Nature Switzerland
Reference14 articles.
1. Arora, S., Rao, S., Vazirani, U.V.: Expander flows, geometric embeddings and graph partitioning. J. ACM 56(2), 5:1–5:37 (2009). Preliminary version in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC) (2004)
2. Bodlaender, H.L., Fomin, F.V., Golovach, P.A., Otachi, Y., van Leeuwen, E.J.: Parameterized complexity of the spanning tree congestion problem. Algorithmica 64(1), 85–111 (2012)
3. Borůvka, O.: O jistém problému minimálním (About a certain minimal problem). Práce Moravské přírodovědecké společnosti III(3), 37–58 (1926)
4. Feige, U., Krauthgamer, R.: A polylogarithmic approximation of the minimum bisection. SIAM J. Comput. 31(4), 1090–1118 (2002)
5. Fernandes, C.G., Schmidt, T.J., Taraz, A.: On minimum bisection and related cut problems in trees and tree-like graphs. J. Graph Theory 89(2), 214–245 (2018)