scientific article; zbMATH DE number 910878

zbMATH Open0853.68139MaRDI QIDQ4886052FDOQ4886052

Authors Jonathan W. Berry, Mark K. Goldberg

Publication date 12 December 1996

Full work available at URL https://arxiv.org/abs/math/9504213

zbMATH Keywords

graph partitioningpath optimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Path optimization for graph partitioning problems
• On Computational Aspects of Greedy Partitioning of Graphs
• scientific article; zbMATH DE number 1942408
• Computational aspects of greedy partitioning of graphs
• scientific article; zbMATH DE number 5761786
• Efficient algorithms for some path partitioning problems
• scientific article; zbMATH DE number 4011955
• Graph partitioning: an updated survey
• Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

Cited in

(20)

• An efficient approach for large scale graph partitioning
• Lock-gain based graph partitioning
• An experimental evaluation of local search heuristics for graph partitioning
• Isoperimetric Partitioning: A New Algorithm for Graph Partitioning
• q-partitioning of graphs with finite coordination number
• Abusing a hypergraph partitioner for unweighted graph partitioning
• Path optimization for graph partitioning problems
• Cut Size Statistics of Graph Bisection Heuristics
• Beyond good partition shapes: an analysis of diffusive graph partitioning
• An algorithm for improving graph partitions
• Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic
• scientific article; zbMATH DE number 437546 (Why is no real title available?)
• scientific article; zbMATH DE number 1982182 (Why is no real title available?)
• Quotient tree partitioning of undirected graphs
• scientific article; zbMATH DE number 3855168 (Why is no real title available?)
• Integer Programming and Combinatorial Optimization
• A stochastic heuristic visualising graph clusters in a bi-dimensional space prior to partitioning
• scientific article; zbMATH DE number 1560342 (Why is no real title available?)
• A New Heuristic for Partitioning the Nodes of a Graph
• A learning algorithm for the longest common subsequence problem

This page was built for publication:

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