Path optimization for graph partitioning problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 910878
- Efficient algorithms for some path partitioning problems
- scientific article; zbMATH DE number 5761786
- Improved algorithms for path partition and related problems
- Approximation algorithms for the directed path partition problems
- The path partition problem and related problems in bipartite graphs
- Efficient algorithms for path partitions
- The path-partition problem in block graphs
- Conditions for graphs to be path partition optimal
Cites work
- scientific article; zbMATH DE number 437546 (Why is no real title available?)
- scientific article; zbMATH DE number 3858396 (Why is no real title available?)
- scientific article; zbMATH DE number 3891429 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 3390827 (Why is no real title available?)
- .878-approximation algorithms for MAX CUT and MAX 2SAT
- A linear time algorithm for graph partition problems
- A projection technique for partitioning the nodes of a graph
- An Efficient Heuristic Procedure for Partitioning Graphs
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Lower Bounds for the Partitioning of Graphs
- Node and edge relaxations of the max-cut problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Optimization by simulated annealing
- The maximum concurrent flow problem
- Unit disk graphs
Cited in
(19)- The main tools and test benches for graph partitioning
- An efficient approach for large scale graph partitioning
- Isoperimetric Partitioning: A New Algorithm for Graph Partitioning
- Combinatorial optimization of special graphs for nodal ordering and graph partitioning
- An experimental evaluation of semidefinite programming and spectral algorithms for max cut
- Performance-driven layer assignment by integer linear programming and path-constrained hypergraph partitioning
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- scientific article; zbMATH DE number 5990414 (Why is no real title available?)
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
- scientific article; zbMATH DE number 910878 (Why is no real title available?)
- Beyond good partition shapes: an analysis of diffusive graph partitioning
- scientific article; zbMATH DE number 177834 (Why is no real title available?)
- Conditions for graphs to be path partition optimal
- Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic
- Solving graph partitioning problems arising in tagless cache management
- Experiments on the minimum linear arrangement problem
- Vertex ordering and partitioning problems for random spatial graphs.
- A New Heuristic for Partitioning the Nodes of a Graph
- New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation
This page was built for publication: Path optimization for graph partitioning problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1276954)
