Compact distributed certification of planar graphs (Q2037111): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3157038403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The local detection paradigm and its applications to self-stabilization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Dominating Set Approximations beyond Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new distributed depth-first-search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Approximation Algorithms for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Approximations in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4967211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Redundancy in distributed proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Distributed Certification of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5090917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a complexity theory for local distributed computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distributed Merlin-Arthur decision protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized proof-labeling schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of planar graphs by Trémaux orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Upper Bound on Zarankiewicz' Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Algorithms for Planar Networks I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3179347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive Distributed Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof labeling schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: What cannot be computed locally! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed minimum dominating set approximations in restricted families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Distributed Verifiers in Interactive Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms for the diameter and radius of sparse graphs / 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: A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:17, 26 July 2024

scientific article
Language Label Description Also known as
English
Compact distributed certification of planar graphs
scientific article

    Statements

    Compact distributed certification of planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 June 2021
    0 references
    distributed algorithms
    0 references
    network algorithms
    0 references
    graph property certification
    0 references
    labeling schemes
    0 references
    planarity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers