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 harmonious chromatic number of triple star graph
by: Akhlak Mansuri
Published: (2016-06-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) -
GRACEFUL CHROMATIC NUMBER OF SOME CARTESIAN PRODUCT GRAPHS
by: I Nengah Suparta, et al.
Published: (2023-12-01) -
Graph Entropy of Some Special Chemical Graphs
by: B. I. Andrew, et al.
Published: (2024-12-01) -
ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS
by: Pavel A. Gein
Published: (2021-07-01)