Distribution-free connectivity testing for sparse graphs (Q926283): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-007-9054-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046654297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing subgraphs in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every monotone graph property is testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient testing of large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Languages are Testable with a Constant Number of Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing of Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing triangle-freeness in general graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved low-degree testing and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximate PCPs for multidimensional bin-packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-testing/correcting with applications to numerical problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing hypergraph colorability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spot-checkers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strength of comparisons in property testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3152421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing of matrix properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity testing over general poset domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing juntas / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Testing Expansion in Bounded-Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing in bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three theorems regarding testing graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing and its connection to learning and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Testing Bipartiteness in General Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Membership in Languages that Have Small Width Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing the diameter of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing metric properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing membership in parenthesis languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4788610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Robustness of Functional Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Characterizations of Polynomials with Applications to Program Testing / rank
 
Normal rank

Latest revision as of 09:48, 28 June 2024

scientific article
Language Label Description Also known as
English
Distribution-free connectivity testing for sparse graphs
scientific article

    Statements

    Distribution-free connectivity testing for sparse graphs (English)
    0 references
    0 references
    0 references
    0 references
    27 May 2008
    0 references
    Property testing
    0 references
    Distribution-free testing
    0 references
    Connectivity testing
    0 references
    Properties of sparse graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers