scientific article; zbMATH DE number 6472641
From MaRDI portal
Publication:5501843
zbMath1321.05259MaRDI QIDQ5501843
No author found.
Publication date: 14 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (5)
Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking ⋮ On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem ⋮ Approximating small balanced vertex separators in almost linear time ⋮ A new lower bound for the bipartite crossing number with applications ⋮ Continuous graph partitioning for camera network surveillance
This page was built for publication:
