Fast distributed algorithms for testing graph properties (Q5915702): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
description / endescription / en
scientific article; zbMATH DE number 6919228
scientific article; zbMATH DE number 7040099
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1428.68369 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/s00446-018-0324-8 / rank
 
Normal rank
Property / published in
 
Property / published in: Distributed Computing / rank
 
Normal rank
Property / publication date
 
21 March 2019
Timestamp+2019-03-21T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 21 March 2019 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7040099 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2253610808 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2789477538 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1602.03718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many Random Walks Are Faster Than One / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Triangle-Freeness in General Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing <i>k</i>-colorability / 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: Distributedly Testing Cycle-Freeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Proof-Labeling Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing properties of directed graphs: acyclicity and connectivity* / 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: Distributed discovery of large near-cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods in the congested clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The communication complexity of distributed task allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of the congested clique model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4668732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed MST and Routing in Almost Mixing Time / 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: A sublinear bipartiteness tester for 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: Algorithmic Aspects of Property Testing in the Dense Graphs Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three theorems regarding testing graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-local probes do not help with many graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large cuts with local algorithms on triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal distributed all pairs shortest paths and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle Finding and Listing in CONGEST Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model / 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: Proof labeling schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient distributed source detection with limited bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing the diameter of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed coloring algorithms for triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3615896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: lgorithmic and Analysis Techniques in Property Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Characterizations of Polynomials with Applications to Program Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Verification and Hardness of Distributed Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Random Walks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:04, 18 July 2024

scientific article; zbMATH DE number 7040099
Language Label Description Also known as
English
Fast distributed algorithms for testing graph properties
scientific article; zbMATH DE number 7040099

    Statements

    Fast distributed algorithms for testing graph properties (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 August 2018
    0 references
    21 March 2019
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references