scientific article; zbMATH DE number 5605086

zbMATH Open1169.68442MaRDI QIDQ3396583FDOQ3396583

Authors: Christian Sohler, Artur Czumaj 

Publication date: 19 September 2009

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (12)

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

This page was built for publication:

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