Zobrazeno 1 - 10
of 115
pro vyhledávání: '"Taskin Z"'
The maximum number of edges in a graph with matching number m and maximum degree d has been determined in [1] and [2], where some extremal graphs have also been provided. Then, a new question has emerged: how the maximum edge count is affected by for
Externí odkaz:
http://arxiv.org/abs/2304.01729
We consider the selective graph coloring problem, which is a generalization of the classical graph coloring problem. Given a graph together with a partition of its vertex set into clusters, we want to choose exactly one vertex per cluster so that the
Externí odkaz:
http://arxiv.org/abs/1811.12094
Chordal graphs form one of the most studied graph classes. Several graph problems that are NP-hard in general become solvable in polynomial time on chordal graphs, whereas many others remain NP-hard. For a large group of problems among the latter, ap
Externí odkaz:
http://arxiv.org/abs/1810.13326
Channel coding aims to minimize errors that occur during the transmission of digital information from one place to another. Low-density parity-check (LDPC) codes can detect and correct transmission errors if one encodes the original information by ad
Externí odkaz:
http://arxiv.org/abs/1803.04798
In a digital communication system, information is sent from one place to another over a noisy communication channel using binary symbols (bits). Original information is encoded by adding redundant bits, which are then used by low--density parity--che
Externí odkaz:
http://arxiv.org/abs/1709.09936
In a digital communication system, information is sent from one place to another over a noisy communication channel. It may be possible to detect and correct errors that occur during the transmission if one encodes the original information by adding
Externí odkaz:
http://arxiv.org/abs/1708.05618
Autor:
Kalay, Serkan, Taşkın, Z. Caner
Publikováno v:
In Computers and Operations Research November 2021 135
Publikováno v:
In Computers and Operations Research October 2019 110:1-17
Publikováno v:
In Discrete Applied Mathematics 31 May 2019 261:2-21
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.