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

General introduction to graph partitioning

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

zbMATH Open1254.05146MaRDI QIDQ2912413FDOQ2912413


Authors: Charles Edmond Bichot Edit this on Wikidata


Publication date: 14 September 2012





Recommendations

  • Graph partitioning
  • scientific article; zbMATH DE number 637295
  • Graph and hypergraph partitioning
  • scientific article; zbMATH DE number 5761786
  • Generalized partitions of graphs
  • Graph partitioning: an updated survey
  • A computational study of graph partitioning
  • Some graph partitioning problems
  • scientific article; zbMATH DE number 1202982
  • Partitions of Graphs


zbMATH Keywords

networksgraph partitioning optimization


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)



Cited In (3)

  • Hypergraph partitioning
  • A symmetry-based splitting strategy for discretizable distance geometry problems
  • Graph and hypergraph partitioning





This page was built for publication: General introduction to graph partitioning

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2912413&oldid=15881310"
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