Pages that link to "Item:Q3990110"
From MaRDI portal
The following pages link to Locality in Distributed Graph Algorithms (Q3990110):
Displaying 50 items.
- Tight bounds for parallel randomized load balancing (Q287991) (← links)
- Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds (Q342718) (← links)
- Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
- On the time and the bit complexity of distributed randomised anonymous ring colouring (Q391396) (← links)
- Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647) (← links)
- Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191) (← links)
- On the two largest distance eigenvalues of graph powers (Q503610) (← links)
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- Local computation algorithms for graphs of non-constant degrees (Q524360) (← links)
- Distributed approximation of capacitated dominating sets (Q613113) (← links)
- Local MST computation with short advice (Q613116) (← links)
- On the relationship between continuous- and discrete-time quantum walk (Q625458) (← links)
- Local algorithms for edge colorings in UDGs (Q638541) (← links)
- Analysing local algorithms in location-aware quasi-unit-disk graphs (Q642985) (← links)
- An optimal bit complexity randomized distributed MIS algorithm (Q658666) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs (Q666086) (← links)
- Coloring chains for compression with uncertain priors (Q668010) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- Minimum entropy combinatorial optimization problems (Q693045) (← links)
- Local approximability of max-min and min-max linear programs (Q693753) (← links)
- About randomised distributed graph colouring and graph partition algorithms (Q710742) (← links)
- A local approximation algorithm for minimum dominating set problem in anonymous planar networks (Q748117) (← links)
- Distributed independent sets in interval and segment intersection graphs (Q831804) (← links)
- A faster distributed protocol for constructing a minimum spanning tree (Q856405) (← links)
- Distributed algorithms for weighted problems in sparse graphs (Q866546) (← links)
- Efficient quantum algorithms for simulating sparse Hamiltonians (Q883042) (← links)
- Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time (Q896557) (← links)
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- Coding for a multiple access OR channel: A survey (Q947083) (← links)
- Complexity analysis of a decentralised graph colouring algorithm (Q963399) (← links)
- Exact leaf powers (Q982668) (← links)
- A simple local 3-approximation algorithm for vertex cover (Q987844) (← links)
- An optimal maximal independent set algorithm for bounded-independence graphs (Q992507) (← links)
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition (Q992509) (← links)
- Local edge colouring of Yao-like subgraphs of unit disk graphs (Q1008738) (← links)
- Low diameter graph decompositions (Q1316650) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- Computing roots of graphs is hard (Q1336641) (← links)
- Deterministic broadcasting time with partial knowledge of the network. (Q1401209) (← links)
- Distributed broadcast in radio networks of unknown topology. (Q1401336) (← links)
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. (Q1426451) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Randomized OBDD-based graph algorithms (Q1625606) (← links)
- Node labels in local decision (Q1625609) (← links)
- Design patterns in beeping algorithms: examples, emulation, and analysis (Q1633808) (← links)
- Impact of locality on location aware unit disk graphs (Q1662429) (← links)
- What can be verified locally? (Q1672006) (← links)
- Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem (Q1686849) (← links)
