Local Out-Tournaments with Upset Tournament Strong Components I: Full and Equal {0,1}-Matrix Ranks

A digraph D is a local out-tournament if the outset of every vertex is a tournament. Here, we use local out-tournaments, whose strong components are upset tournaments, to explore the corresponding ranks of the adjacency matrices. Of specific interest is the out-tournament whose adjacency matrix has boolean, nonnegative integer, term, and real rank all equal to the number of vertices, n. Corresponding results for biclique covers and partitions of the digraph are provided

A characterization of linear operators that preserve isolation numbers

We obtain characterizations of Boolean linear operators that preserve some of the isolation numbers of Boolean matrices. In particular, we show that the following are equivalent: (1) $T$ preserves the isolation number of all matrices; (2) $T$ preserves the set of matrices with isolation number one and the set of those with isolation number $k$ for some $2leq kleq min{m,n}$; (3) for $1leq kleq min{m,n}-1$, $T$ preserves matrices with isolation number $k$, and those with isolation number $k+1$, (4) $T$ maps $J$ to $J$ and preserves the set of matrices of isolation number 2; (5) $T$ is a $(P,Q)$-operator, that is, for fixed permutation matrices $P$ and $Q$, $mtimes n$ matrix $X,$~ $T(X)=PXQ$ or, $m=n$ and $T(X)=PX^tQ$ where $X^t$ is the transpose of $X$

Out-Tournament Adjacency Matrices with Equal Ranks

Much work has been done in analyzing various classes of tournaments, giving a partial characterization of tournaments with adjacency matrices having equal and full real, nonnegative integer, Boolean, and term ranks. Relatively little is known about the corresponding adjacency matrix ranks of local out-tournaments, a larger family of digraphs containing the class of tournaments. Based on each of several structural theorems from Bang-Jensen, Huang, and Prisner, we will identify several classes of out-tournaments which have the desired adjacency matrix rank properties. First we will consider matrix ranks of out-tournament matrices from the perspective of the structural composition of the strong component layout of the adjacency matrix. Following that, we will consider adjacency matrix ranks of an out-tournament based on the cycles that the out-tournament contains. Most of the remaining chapters consider the adjacency matrix ranks of several classes of out-tournaments based on the form of their underlying graphs. In the case of the strong out-tournaments discussed in the final chapter, we examine the underlying graph of a representation that has the strong out-tournament as its catch digraph

On the Parameterized Complexity of Biclique Cover and Partition

Given a bipartite graph G, we consider the decision problem called BicliqueCover for a fixed positive integer parameter k where we are asked whether the edges of G can be covered with at most k complete bipartite subgraphs (a.k.a. bicliques). In the BicliquePartition problem, we have the additional constraint that each edge should appear in exactly one of the k bicliques. These problems are both known to be NP-complete but fixed parameter tractable. However, the known FPT algorithms have a running time that is doubly exponential in k, and the best known kernel for both problems is exponential in k. We build on this kernel and improve the running time for BicliquePartition to O*(2^{2k^2+k*log(k)+k}) by exploiting a linear algebraic view on this problem. On the other hand, we show that no such improvement is possible for BicliqueCover unless the Exponential Time Hypothesis (ETH) is false by proving a doubly exponential lower bound on the running time. We achieve this by giving a reduction from 3SAT on n variables to an instance of BicliqueCover with k=O(log(n)). As a further consequence of this reduction, we show that there is no subexponential kernel for BicliqueCover unless P=NP. Finally, we point out the significance of the exponential kernel mentioned above for the design of polynomial-time approximation algorithms for the optimization versions of both problems. That is, we show that it is possible to obtain approximation factors of n/log(n) for both problems, whereas the previous best approximation factor was n/sqrt(log(n))

Parameterized Low-Rank Binary Matrix Approximation

We provide a number of algorithmic results for the following family of problems: For a given binary m x n matrix A and a nonnegative integer k, decide whether there is a "simple" binary matrix B which differs from A in at most k entries. For an integer r, the "simplicity" of B is characterized as follows. - Binary r-Means: Matrix B has at most r different columns. This problem is known to be NP-complete already for r=2. We show that the problem is solvable in time 2^{O(k log k)}*(nm)^O(1) and thus is fixed-parameter tractable parameterized by k. We also complement this result by showing that when being parameterized by r and k, the problem admits an algorithm of running time 2^{O(r^{3/2}* sqrt{k log k})}(nm)^O(1), which is subexponential in k for r in o((k/log k)^{1/3}). - Low GF(2)-Rank Approximation: Matrix B is of GF(2)-rank at most r. This problem is known to be NP-complete already for r=1. It is also known to be W[1]-hard when parameterized by k. Interestingly, when parameterized by r and k, the problem is not only fixed-parameter tractable, but it is solvable in time 2^{O(r^{3/2}* sqrt{k log k})}(nm)^O(1), which is subexponential in k for r in o((k/log k)^{1/3}). - Low Boolean-Rank Approximation: Matrix B is of Boolean rank at most r. The problem is known to be NP-complete for k=0 as well as for r=1. We show that it is solvable in subexponential in k time 2^{O(r2^r * sqrt{k log k})}(nm)^O(1)