Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

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

zbMath1408.05003MaRDI QIDQ2922529

Henning Meyerhenke

Publication date: 11 October 2014

Full work available at URL: https://digital.ub.uni-paderborn.de/hs/content/titleinfo/5108

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

heuristic algorithmsundirected graphgraph clusteringdense regions


Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Density (toughness, etc.) (05C42)


Related Items (2)

Beyond good partition shapes: an analysis of diffusive graph partitioning ⋮ Randomized diffusion for indivisible loads


Uses Software

  • METIS
  • JOSTLE
  • DibaP



This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2922529&oldid=15896035"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki