Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract)

DOI10.1007/978-3-642-11409-0_14zbMath1273.68155OpenAlexW1549976573MaRDI QIDQ5851102

Zhilin Wu, Stéphane Grumbach

Publication date: 21 January 2010

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11409-0_14

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Classical first-order logic (03B10) Descriptive complexity and finite models (68Q19)

Related Items (3)

Distributed minimum vertex coloring and maximum independent set in chordal graphs ⋮ Energy-efficient distributed algorithms for synchronous networks ⋮ Allowing each node to communicate only once in a distributed system: shared whiteboard models

This page was built for publication: Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract)