Q6084359 (Q6084359): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.4230/lipics.approx/random.2020.16 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Triangle-Freeness in General Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of the (Natural) Graph Properties Testable with One-Sided Error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every minor-closed property of sparse graphs is testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural results on matching estimation with applications to streaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptivity hierarchy theorem for property testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Ordering Problems in Directed Graph Streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Graphs: Random Walks and Bipartiteness Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating two property testing models for bounded degree directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Maximum Matching in Random Streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Property Testing / 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: Property testing in bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Proximity-Oblivious Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three theorems regarding testing graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic graph stream algorithms in \(o(n)\) space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Testability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating matching size from random streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples / 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: Maximum Matching in Semi-streaming with Few Passes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Forest-Isomorphism in the Adjacency List Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5240429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testable bounded degree graph properties are random order streamable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Property of Hyperfinite Graphs Is Testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing the diameter of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Characterizations of Polynomials with Applications to Program Testing / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.APPROX/RANDOM.2020.16 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:17, 30 December 2024

scientific article; zbMATH DE number 7758318
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7758318

    Statements

    0 references
    0 references
    0 references
    0 references
    31 October 2023
    0 references
    graph property testing
    0 references
    sublinear algorithms
    0 references
    graph streaming algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references