On the minimum edge bisection of graph

DOI10.1007/978-981-96-1090-7_31MaRDI QIDQ6970714zbMATH OpenFDO

Authors Kun You, Bin Tang, Yi F. Chen, Baoliu Ye

Publication date 17 June 2025

Full work available at URL https://doi.org/10.1007/978-981-96-1090-7_31

zbMATH Keywords

edge partitioningminimum edge bisectionpower-law graph

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A polylogarithmic approximation of the minimum bisection
• A Random Graph Model for Power Law Graphs
• An Efficient Heuristic Procedure for Partitioning Graphs
• Approximating the minimum bisection size (extended abstract)
• Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
• Expander flows, geometric embeddings and graph partitioning
• Finding k Cuts within Twice the Optimal
• scientific article; zbMATH DE number 5485537 (Why is no real title available?)
• scientific article; zbMATH DE number 2086657 (Why is no real title available?)
• Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique

This page was built for publication: On the minimum edge bisection of graph

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