scientific article; zbMATH DE number 5605086

MaRDI QIDQ3396583zbMATH OpenFDO

Authors Christian Sohler, Artur Czumaj

Publication date 19 September 2009

Mathematics Subject Classification ID

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

Cited in

(11)

• Deterministic metric 1-median selection with very few queries
• 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
• Testing the expansion of a graph
• Some results on approximate 1-median selection in metric spaces
• Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs
• Small space representations for metric min-sum \(k\)-clustering and their applications
• Sublinear-time algorithms for tournament graphs
• Testing the \((s,t)\) connectivity of graphs and digraphs

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)