Local algorithms for sparse spanning graphs (Q2300722): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-019-00612-6 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2966775177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property-preserving data reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Computation of PageRank Contributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding sparse cuts locally using evolving sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bookmark-Coloring Algorithm for Personalized PageRank Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Reconstructors and Tolerant Testers for Connectivity and Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Minimum Spanning Tree Weight in Sublinear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Constructing Very Sparse Spanners and Emulators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Stateless Centralized Local Algorithms 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: Local Graph Partitions for Approximation and Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noise Tolerance of Expanders and Sublinear Expansion Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Construction of Smallk-Dominating Sets and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5002766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4967233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing near spanning trees with few local inspections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Algorithms for Sparse Spanning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Local Algorithm for Constructing Spanners in Minor-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphiesätze für Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Converting Online Algorithms to Local Computation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Local Computation Approximation Scheme to Maximum Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the distance to properties in bounded-degree and general sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Can be Computed Locally? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow-Based Algorithms for Local Graph Clustering / 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: Q5090437 / 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: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Token Distribution Problem / 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 algorithms for ultrasparse spanners and linear size skeletons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Monotonicity Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators without the XOR lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved constant-time approximation algorithm for maximum~matchings / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-019-00612-6 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:21, 17 December 2024

scientific article
Language Label Description Also known as
English
Local algorithms for sparse spanning graphs
scientific article

    Statements

    Local algorithms for sparse spanning graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 February 2020
    0 references
    sublinear algorithms
    0 references
    local algorithms
    0 references
    sparse spanning subgraphs
    0 references
    minor-free graphs
    0 references
    property testing
    0 references
    bounded degree model
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers