Identifying codes of Cartesian product of two cliques of the same size.
Gravier, S., Moncel, J., Semri, A. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “New bounds for codes identifying vertices in graphs.”
Identifying codes of Cartesian product of two cliques of the same size.
Graphs associated with codes of covering radius 1 and minimum distance 2.
Hall, Joanne L. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Adaptive identification in Torii in the King lattice.
Ben-Haim, Yael, Gravier, Sylvain, Lobstein, Antoine, Moncel, Julien (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Construction of codes identifying sets of vertices.
Gravier, Sylvain, Moncel, Julien (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
An optimal strongly identifying code in the infinite triangular grid.
Honkala, Iiro (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On identifying codes in the King grid that are robust against edge deletions.
Honkala, Iiro, Laihonen, Tero (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
General bounds for identifying codes in some infinite regular graphs.
Charon, Irène, Honkala, Iiro, Hudry, Olivier, Lobstein, Antoine (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Identifying codes with small radius in some infinite regular graphs.
Charon, Irène, Hudry, Olivier, Lobstein, Antoine (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
5-Stars of Low Weight in Normal Plane Maps with Minimum Degree 5
Oleg V. Borodin, Anna O. Ivanova, Tommy R. Jensen (2014)
Discussiones Mathematicae Graph Theory
Similarity:
It is known that there are normal plane maps M5 with minimum degree 5 such that the minimum degree-sum w(S5) of 5-stars at 5-vertices is arbitrarily large. In 1940, Lebesgue showed that if an M5 has no 4-stars of cyclic type (5, 6, 6, 5) centered at 5-vertices, then w(S5) ≤ 68. We improve this bound of 68 to 55 and give a construction of a (5, 6, 6, 5)-free M5 with w(S5) = 48
Implementation of directed acyclic word graph
Miroslav Balík (2002)
Kybernetika
Similarity:
An effective implementation of a Directed Acyclic Word Graph (DAWG) automaton is shown. A DAWG for a text is a minimal automaton that accepts all substrings of a text , so it represents a complete index of the text. While all usual implementations of DAWG needed about 30 times larger storage space than was the size of the text, here we show an implementation that decreases this requirement down to four times the size of the text. The method uses a compression of DAWG elements, i....