scientific article

zbMath1169.68442MaRDI QIDQ3396583

Christian Sohler, Artur Czumaj

Publication date: 19 September 2009

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Related Items (11)

Can we locally compute sparse connected subgraphs? ⋮ Sublinear-Time Algorithms for Tournament Graphs ⋮ Property testing for cyclic groups and beyond ⋮ Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs ⋮ Some results on approximate 1-median selection in metric spaces ⋮ Testing the \((s,t)\) connectivity of graphs and digraphs ⋮ Sublinear-time algorithms for tournament graphs ⋮ Every minor-closed property of sparse graphs is testable ⋮ Testing the expansion of a graph ⋮ Small space representations for metric min-sum \(k\)-clustering and their applications ⋮ Robust characterizations of k -wise independence over product spaces and related testing results

This page was built for publication: