Design of Coded Caching Schemes With Linear Subpacketizations Based on Injective Arc Coloring of Regular Digraphs
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Communications"
DOI: 10.1109/tcomm.2023.3252031
Abstract: Coded caching is an effective technique to decongest the amount of traffic in the backhaul link. In such a scheme, each file hosted in the server is divided into a number of packets to pursue… read more here.
Keywords: injective arc; arc coloring; digraphs; coded caching ... See more keywords
The diameter of cyclic Kautz digraphs
Sign Up to like & getrecommendations! Published in 2017 at "Filomat"
DOI: 10.2298/fil1720551b
Abstract: We present a new kind of digraphs, called cyclic Kautz digraphs CK(d,l), which are subdigraphs of the well-known Kautz digraphs K(d,l). The latter have the smallest diameter among all digraphs with their number of vertices… read more here.
Keywords: digraphs; kautz digraphs; diameter cyclic; cyclic kautz ... See more keywords
Decision-Making Approach Based on Neutrosophic Rough Information
Sign Up to like & getrecommendations! Published in 2018 at "Algorithms"
DOI: 10.3390/a11050059
Abstract: Rough set theory and neutrosophic set theory are mathematical models to deal with incomplete and vague information. These two theories can be combined into a framework for modeling and processing incomplete information in information systems.… read more here.
Keywords: digraphs; information; neutrosophic rough; based neutrosophic ... See more keywords