Showing papers in "Electronic Notes in Discrete Mathematics in 2005"

TL;DR: This work is devoted to evaluating the so-called metric dimension of a finite connected graph, i.e., the minimum cardinality of a resolving set, for a number of graph families, as long as to study its behavior with respect to the join and the cartesian product of graphs.

TL;DR: This paper supports the conjecture that solutions for projective POVMs exist in any dimension by constructing explicit algebraic solutions in small dimensions d, in particular d = 12.

TL;DR: The intersection graph G(R) of nontrivial left ideals of a ring R is considered, which is a set of all non-isomorphic graphs of Z n for a given number of vertices.

TL;DR: Luczak’s result is strengthened and Bondy and Erdős’ conjecture that if n is odd and Cn denotes the cycle on n vertices, then R(Cn, Cn,Cn) = 4n + o(n) is verified for n sufficiently large is strengthened.

TL;DR: It is shown that the p positive elements can be determined up to a constant number of misclassifications, bounded by the gap between the thresholds, and a two-phase strategy consisting of a Distill and a Compress phase is proposed.

TL;DR: A branch-and-cut-andprice for the GAP problem featuring a stabilization mechanism to accelerate column generation convergence and ellipsoidal cuts, a new way of transforming the exact algorithm into a powerful heuristic, in the same spirit of the cuts recently proposed by Fischetti and Lodi.

TL;DR: A survey of the AutoGraphiX (AGX) research program for computer assisted and, for some functions, automated graph theory can be found in this article, where the authors present a survey of their work.

TL;DR: In this article, the existence of a subgraph where the degrees of the vertices are pre-specified was shown to be true for the case where the degree of each vertex is fixed.

TL;DR: It is shown that any cubic bridgeless graph with m edges contains two perfect matching that cover at least 3m/5 edges, and three perfect matchings that covered at least 27m/35 edges.

TL;DR: A completely discrete exact BP-F algorithm is presented and two other methods also derived to solve the tomographic problem.

TL;DR: Several theoretical approaches are surveyed including ones approximating the apparently nearly optimal one based on Kolmogorov conditional complexity and some case studies: attributing Shakespeare canon and newly discovered works as well as allegedly M. Twain's newly-discovered works, Federalist papers binary (Madison vs. Hamilton) discrimination using Naive Bayes and other classifiers, and steganography presence testing.

TL;DR: This work investigates a similar problem for paired-domination, and obtains a lower bound in terms of product of domination number of one factor and 3-packing of the other factor.

TL;DR: A unified theory of information transfer is presented, which naturally incorporates Shannon's theories of information transmission and the theory of identification in the presence of noise as extremal cases and provides several novel coding theorems.

TL;DR: Shannon’s Channel Coding Theorem for Transmission is paralleled by a Channel Coded The theorem for Identification, which seems natural to look for such a parallel for sources, in particular for noiseless coding.

TL;DR: This paper considers a variant of the search game introduced by Barriere et al.

TL;DR: This paper addresses the topic of the order of projection views when they are iteratively processed in a view-by-view manner and investigates the 2D reconstruction problem with several processing order strategies.

TL;DR: It is shown that if the authors fix any rectangle A in Z 2 then there exists a so called valid set S of four directions depending only on the size of A such that any two subsets of A can be distinguished, using these directions only.

TL;DR: A subclass of perfect graphs: the cographs, which correspond to graphs without paths with size 4, is considered, and a characterization of cographs that are ( k, l ) -graphs by forbidden configurations is provided, that is, a cograph G is a ( k , l) -graph if and only if it does not contain any of the forbbiden configurations.

TL;DR: Classes of graphs with bounded expansion are introduced, based on a new invariant, the greatest reduced average density of G with rank r, ∇r(G), which generalize to these classes some results proved for proper minor closed classes and bounded degree graphs, such as the existence of low tree-width colorings and homomorphism dualities.

TL;DR: It is shown that discrete tomography is suitable to increase the possible inspection size of single material oblong objects compared to filtered back projection in non-destructive testing (NDT) with 2D X-ray computed tomography (CT).

TL;DR: A lower bound on the transmission capacity is presented, which is conjecture to be tight and which is proved to be Tight for Wyner's original (degraded) wire-tape channel and also for the reversely degraded wire-Tape channel for which the legitimate receiver gets a degraded version from the enemy.

TL;DR: The following problem proposed by Alcatel is investigated: a satellite sends information to receivers on earth, each of which is listening on a chosen frequency, and part of the signal will be spread in an area around its destination and this creates noise for nearby receivers on the same frequency.

TL;DR: This work investigates the minimum number of colors needed for vertex coloring of a graph by combining graph colorings with Thue sequences, and decides if there is, possibly huge, such that $\pi_k(G)$ is bounded for planar graphs.

TL;DR: It is shown that the difference-of-convex-functions DC-programming framework is flexible enough to cope with this more general model class, and results show that reconstruction becomes feasible under conditions where the previous approach fails.

TL;DR: A new generalization of the modular decomposition called the bi-join decomposition is introduced, characterized the completely decomposable graphs and a linear-time decomposition algorithm is given.

TL;DR: A linear time algorithm is presented that, given a planar graph G, either finds a minimum odd cycle vertex transversal in G or guarantees that there is noTransversal of size at most k.

TL;DR: A number of properties involving different types of boundary vertices are obtained: peripheral, contour and eccentric vertices, including a realization theorem that not only corrects a wrong statement detected in [2], but also improves it.

TL;DR: In this article, the vertex coloring problem was revisited to remove symmetry, and new versions of facets derived from substructures of G were presented, including cliques, odd holes and anti-holes and wheels.

TL;DR: H is η-far from P if no hypergraph G with |E(G)4E(H)| ≤ ηn satisfies P .