scientific article; zbMATH DE number 910878
From MaRDI portal
Publication:4886052
zbMATH Open0853.68139arXivmath/9504213MaRDI QIDQ4886052FDOQ4886052
Authors: Jonathan W. Berry, Mark K. Goldberg 
Publication date: 12 December 1996
Full work available at URL: https://arxiv.org/abs/math/9504213
Title of this publication is not available (Why is that?)
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (20)
- An efficient approach for large scale graph partitioning
- Integer Programming and Combinatorial Optimization
- Title not available (Why is that?)
- Cut Size Statistics of Graph Bisection Heuristics
- Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic
- Lock-gain based graph partitioning
- A stochastic heuristic visualising graph clusters in a bi-dimensional space prior to partitioning
- Isoperimetric Partitioning: A New Algorithm for Graph Partitioning
- Path optimization for graph partitioning problems
- Abusing a hypergraph partitioner for unweighted graph partitioning
- Title not available (Why is that?)
- Quotient tree partitioning of undirected graphs
- Title not available (Why is that?)
- An experimental evaluation of local search heuristics for graph partitioning
- A New Heuristic for Partitioning the Nodes of a Graph
- A learning algorithm for the longest common subsequence problem
- q-partitioning of graphs with finite coordination number
- Beyond good partition shapes: an analysis of diffusive graph partitioning
- Title not available (Why is that?)
- An algorithm for improving graph partitions
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)
