Can we locally compute sparse connected subgraphs? (Q2399362): 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/978-3-319-58747-9_6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2611251582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property-preserving data reconstruction / 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: Improved low-degree testing and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitations of Local Filters of Lipschitz and Monotone Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed (δ+1)-coloring in linear (in δ) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic distributed vertex coloring in polylogarithmic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Locality of Distributed Symmetry Breaking / 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: Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners / 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: Keeping Mobile Robot Swarms Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximating spanner problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best of two local models: centralized local and distributed local algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random-Self-Reducibility of Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple storage scheme for strings achieving entropy bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Distributed Decision / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Distributed Algorithm for Maximal Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Polynomials with Queries: The Highly Noisy Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Encoding of Succinct Data Structures / 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: Q3549710 / 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: Q4526985 / 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: On the efficiency of local decoding procedures for error-correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local list-decoding and testing of random linear codes from high error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed approximation of capacitated dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: What cannot be computed locally! / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of being near-sighted / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of distributed graph coloring / 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: 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: Local computation algorithms for graphs of non-constant degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210157 / 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: Distance Approximation in Bounded-Degree and General Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Can be Computed Locally? / 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: An Optimal Synchronizer for the Hypercube / 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: Squeezing succinct data structures into entropy bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Monotonicity Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A log-star distributed maximal independent set algorithm for growth-bounded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new technique for distributed symmetry breaking / 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

Latest revision as of 07:56, 14 July 2024

scientific article
Language Label Description Also known as
English
Can we locally compute sparse connected subgraphs?
scientific article

    Statements

    Can we locally compute sparse connected subgraphs? (English)
    0 references
    0 references
    22 August 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references