scientific article; zbMATH DE number 1857651
From MaRDI portal
Publication:4788610
zbMath1048.68064MaRDI QIDQ4788610
Publication date: 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Testing metric properties, Additive approximation for edge-deletion problems, Information theory in property testing and monotonicity testing in higher dimension, On the benefits of adaptivity in property testing of dense graphs, Property testing for cyclic groups and beyond, Quantum property testing of group solvability, Discovery of Network Properties with All-Shortest-Paths Queries, Testable and untestable classes of first-order formulae, Efficiently testing sparse \(\text{GF}(2)\) polynomials, Testing consistency of quartet topologies: a parameterized approach, Testing Eulerianity and connectivity in directed sparse graphs, Distribution-free connectivity testing for sparse graphs, Is submodularity testable?, Property-preserving data reconstruction, Testing of matrix-poset properties, Predicting winner and estimating margin of victory in elections using sampling, A separation theorem in property testing, Every minor-closed property of sparse graphs is testable, Discovery of network properties with all-shortest-paths queries, Testing the expansion of a graph, Testing periodicity, Estimating the Longest Increasing Sequence in Polylogarithmic Time, Measuring instance difficulty for combinatorial optimization problems, Testing hypergraph colorability, Sublinear-time Algorithms, Local Property Reconstruction and Monotonicity, Estimating the distance to a monotone function, Tolerant property testing and distance approximation, Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms, Testing subgraphs in directed graphs, A large lower bound on the query complexity of a simple Boolean function
