Graph-Theoretic Limits of Distributed Computation: Entropy, Eigenvalues, and Chromatic Numbers
We address the problem of the distributed computation of arbitrary functions of two correlated sources, <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>X</mi><mn>1</mn></msub...
Saved in:
| Main Authors: | Mohammad Reza Deylam Salehi, Derya Malak |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-07-01
|
| Series: | Entropy |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1099-4300/27/7/757 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
ON THE LOCATING CHROMATIC NUMBER OF DISJOINT UNION OF BUCKMINSTERFULLERENE GRAPHS
by: Debi Zulkarnain, et al.
Published: (2024-05-01) -
On the chromatic number of graphs with some restriction of vertex degrees
by: S.N. Selezneva
Published: (2020-12-01) -
Chromatic Number and some Properties of Pseudo-Von Neumann Regular graph of Cartesian Product of Rings
by: Nermen J. Khalel, et al.
Published: (2020-03-01) -
On Irregular Colorings of Unicyclic Graph Family
by: Arika Indah Kristiana, et al.
Published: (2023-05-01) -
Fuzzy incidence coloring under structural operations for communication channel allocation
by: Angmo Deji, et al.
Published: (2025-08-01)