Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

The main tools and test benches for graph partitioning

From MaRDI portal
Publication:2912428
Jump to:navigation, search

zbMATH Open1254.05150MaRDI QIDQ2912428FDOQ2912428


Authors: Charles Edmond Bichot Edit this on Wikidata


Publication date: 14 September 2012





Recommendations

  • scientific article; zbMATH DE number 5761786
  • Path optimization for graph partitioning problems
  • An effective multilevel tabu search approach for balanced graph partitioning
  • scientific article; zbMATH DE number 2131658
  • Parallel optimisation algorithms for multilevel mesh partitioning


zbMATH Keywords

constrained graph partitioninggraph partitioning optimizationgraph partitioning optimization toolsunconstrained graph partitioning


Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)







This page was built for publication: The main tools and test benches for graph partitioning

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2912428&oldid=15880368"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 20:12. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki