On the public citation graph
On the complexity of distributed graph coloring with local minimality constraints
0 signed · 41 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jagm.1996.0017openalex-snapshot
On the Complexity of Distributed Network Decomposition
inferredcites →https://doi.org/10.1006/jagm.2000.1097openalex-snapshot
Fast Distributed Algorithms for Brooks–Vizing Colorings
inferredcites →https://doi.org/10.1007/11753810_71openalex-snapshot
Managing Random Sensor Networks by means of Grid Emulation
inferredcites →https://doi.org/10.1007/11823285_61openalex-snapshot
On Greedy Graph Coloring in the Distributed Model
inferredcites →https://doi.org/10.1007/978-3-540-27866-5_107openalex-snapshot
Distributed Largest-First Algorithm for Graph Coloring
inferredcites →https://doi.org/10.1007/978-3-540-75142-7_37openalex-snapshot
On the Complexity of Distributed Greedy Coloring
inferredcites →https://doi.org/10.1007/pl00008932openalex-snapshot
Some simple distributed algorithms for sparse networks
inferredcites →https://doi.org/10.1007/s00453-004-1104-3openalex-snapshot
An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms
inferredcites →https://doi.org/10.1016/0020-0190(89)90107-5openalex-snapshot
Welsh-Powell opposition graphs
inferredcites →https://doi.org/10.1016/0020-0255(87)90039-9openalex-snapshot
Algorithms for some graph problems on a distributed computational model
inferredcites →https://doi.org/10.1016/0196-6774(88)90005-3openalex-snapshot
Almost all k-colorable graphs are easy to color
inferredcites →https://doi.org/10.1016/s0020-0190(99)00064-2openalex-snapshot
Simple distributed Δ+1-coloring of graphs
inferredcites →https://doi.org/10.1016/s0166-218x(99)00219-xopenalex-snapshot
The train marshalling problem
inferredcites →https://doi.org/10.1023/a:1019146910724openalex-snapshot
Assigning codes in wireless networks: bounds and scaling properties
inferredcites →https://doi.org/10.1137/0215074openalex-snapshot
A Simple Parallel Algorithm for the Maximal Independent Set Problem
inferredcites →https://doi.org/10.1137/0221015openalex-snapshot
Locality in Distributed Graph Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-15035-8_71openalex-snapshot
Distributing Energy Consumption in Multi-interface Series-Parallel Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-44038-1_85openalex-snapshot
Coverage Subject to a Budget on Multi-Interface Networks with Bounded Carving-Width
inferred← citeshttps://doi.org/10.1007/978-3-030-44041-1_41openalex-snapshot
Budgeted Constrained Coverage on Series-Parallel Multi-interface Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_26openalex-snapshot
What Can Be Observed Locally?
inferred← citeshttps://doi.org/10.1007/978-3-642-13651-1_11openalex-snapshot
Building (1 − ε) Dominating Sets Partition as Backbones in Wireless Sensor Networks Using Distributed Graph Coloring
inferred← citeshttps://doi.org/10.1007/s00446-016-0269-8openalex-snapshot
Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
inferred← citeshttps://doi.org/10.1007/s11721-012-0067-2openalex-snapshot
Distributed graph coloring: an approach based on the calling behavior of Japanese tree frogs
inferred← citeshttps://doi.org/10.1007/s12652-019-01486-wopenalex-snapshot
Energy consumption balancing in multi-interface networks
inferred← citeshttps://doi.org/10.1016/j.ins.2014.06.035openalex-snapshot
Patterns from nature: Distributed greedy colouring with simple messages and minimal graph knowledge
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.11.006openalex-snapshot
A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.09.004openalex-snapshot
Symmetry breaking depending on the chromatic number or the neighborhood growth
inferred← citeshttps://doi.org/10.1109/focs.2019.00037openalex-snapshot
Lower Bounds for Maximal Matchings and Maximal Independent Sets
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00007openalex-snapshot
Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
inferred← citeshttps://doi.org/10.1109/globalsip.2014.7032321openalex-snapshot
Distributed opportunistic spectrum access with spatial reuse in cognitive radio networks
inferred← citeshttps://doi.org/10.1109/iconat57137.2023.10080064openalex-snapshot
One stride ahead Advancements in Dispersed Graph Coloring
inferred← citeshttps://doi.org/10.1145/3461458openalex-snapshot
Lower Bounds for Maximal Matchings and Maximal Independent Sets
inferred← citeshttps://doi.org/10.3390/a13020031openalex-snapshot
Constrained Connectivity in Bounded X-Width Multi-Interface Networks
inferred← citeshttps://doi.org/10.5121/ijcnc.2013.5213openalex-snapshot
Performance Evaluation of Distributed Synchronous Greedy Graph Coloring Algorithms on Wireless Ad Hoc and Sensor Networks
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94607openalex-snapshot
Swarm intelligence techniques for optimization and management tasks insensor networks
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.