Efficient algorithms for a graph partitioning problem

DOI10.1007/978-3-319-78455-7_3MaRDI QIDQ777267zbMATH OpenOpenAlexFDO

Authors S. Vaishali, M. S. Atulya, Nidhi Purohit

Publication date 7 July 2020

Full work available at URL https://doi.org/10.1007/978-3-319-78455-7_3

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Graph-Theoretic Concepts in Computer Science
• Partitioning a weighted tree into subtrees with weights in a given range
• On finding connected balanced partitions of trees
• Partitioning a Weighted Tree to Subtrees of Almost Uniform Size
• scientific article; zbMATH DE number 5526012

Cited in

(10)

• Approximation algorithms for the maximally balanced connected graph tripartition problem
• Efficient algorithm for optimizing spectral partitions
• scientific article; zbMATH DE number 5990414 (Why is no real title available?)
• Comparison of algorithms in graph partitioning
• Very cost effective bipartitions in graphs
• Algorithm Engineering for Optimal Graph Bipartization
• scientific article; zbMATH DE number 1942408 (Why is no real title available?)
• Experimental and Efficient Algorithms
• Approximation algorithms for maximally balanced connected graph partition
• Balanced connected graph partition

This page was built for publication: Efficient algorithms for a graph partitioning problem

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