Path optimization for graph partitioning problems
Authors:
- Jonathan W BerryJBJonathan W Berry
- Mark K GoldbergMGMark K Goldberg
- 1 January 1999
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 90 (1-3) , 27-50
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Path optimization for graph partitioning problemsDiscrete Applied Mathematics, 1999
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- An improved spectral graph partitioning algorithm for mapping parallel computations1992
- A linear time algorithm for graph partition problemsInformation Processing Letters, 1992
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number PartitioningOperations Research, 1991
- Unit disk graphsDiscrete Mathematics, 1990
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph PartitioningOperations Research, 1989
- Finding a Maximum Cut of a Planar Graph in Polynomial TimeSIAM Journal on Computing, 1975
- Lower Bounds for the Partitioning of GraphsIBM Journal of Research and Development, 1973
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970