scientific article
From MaRDI portal
Publication:3124737
zbMath0868.68090MaRDI QIDQ3124737
Publication date: 13 March 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items
Exploring community structure in networks by consensus dynamics ⋮ Weighted modularity optimization for crisp and fuzzy community detection in large-scale networks ⋮ Network bipartitioning in the anti-communicability Euclidean space ⋮ Factoring Boolean functions using graph partitioning ⋮ A note on the SDP relaxation of the minimum cut problem ⋮ Partitioning \(P_4\)-tidy graphs into a stable set and a forest ⋮ The critical node detection problem in networks: a survey ⋮ A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem ⋮ Parallel adaptive subspace correction schemes with applications to elasticity
Uses Software