Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
Christoph Helmberg, Bojan Mohar, Svatopluk Poljak,...
In this paper properties of cell matrices are studied. A determinant of such a matrix is given in a closed form. In the proof a general method for determining a determinant of a s...
The purpose of this note is to sharpen the results in Bouyssou and Pirlot (2005) giving an axiomatic characterization of concordance relations. We show how the conditions used in ...
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
The aim of this work is to obtain explicit conditions (i.e., conditions on the transition rates) for the stochastic comparison of Markov Processes. A general coupling technique is ...