Kernels for storage capacity and dual index coding

The storage capacity of a graph measures the maximum amount of information that can be stored across its vertices, such that the information at any vertex can be recovered from the information stored at its neighborhood. The study of this graph quantity is motivated by applications in distributed st...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of combinatorial theory. Series A Jg. 216; S. 106059
1. Verfasser:	Haviv, Ishay
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.11.2025
Schlagworte:	Index coding Kernelization Minrank Parameterized complexity Storage capacity Index coding Storage capacity Minrank Parameterized complexity Kernelization
ISSN:	0097-3165
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!