B. Klinz, R. Rudolf, and G. J. Woeginger. Permuting matrices to avoid forbidden submatrices. Discrete Applied Mathematics, 60:223--248, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Incomplete Directed Perfect Phylogeny - Pe'er, Shamir, Sharan (2000) (Correct)
....which avoids X 4 has the consecutive ones property in columns. Gus eld [11, Theorem 3] has proven that a matrix which has a phylogenetic tree can be reordered so as to satisfy that property. In fact, the reordering used by Gus eld s proof generates an essentially canonical matrix. Klinz et al. [16] study and review numerous problems of permuting matrices to avoid forbidden submatrices. 4 The Algorithm Let A be the input matrix. De ne G x (A) S; C; E A x ) for x = 1. For a subset ; 6= S 0 S, we say that a character is S 0 semi universal in A if its 0 set does not intersect ....
B. Klinz, R. Rudolf, and G. J. Woeginger. Permuting matrices to avoid forbidden submatrices. Discrete applied mathematics, 60:223-248, 1995.
A General Approach To Avoiding Two by Two Submatrices - Deineko, Rudolf, Woeginger (1993) Self-citation (Rudolf Woeginger) (Correct)
.... a graph is an X graph if and only if there exists an enumeration of its vertices such that its adjacency matrix avoids the two submatrices X 1 = 0 1 1 1 and X 2 = 0 1 1 0 : Further results on 0 1 matrices which avoid forbidden submatrices are given in Klinz, Rudolf and Woeginger [9]. Also the class of Monge matrices can be embedded in our framework and characterized via forbidden 2 Theta 2 submatrices. An n Theta n matrix C is called a Monge matrix , if C fulfills c ij c rs c is c rj for 1 i r n; 1 j s n: 1) Monge matrices play an essential role in discrete ....
B. Klinz, R. Rudolf and G.J. Woeginger, Permuting matrices to avoid forbidden submatrices, Report 234-92, Mathematical Institute, TU Graz, Austria, 1992.
Perspectives of Monge Properties in Optimization - Burkard, Klinz, Rudolf (1995) (14 citations) Self-citation (Klinz Rudolf) (Correct)
....Zaporozhets [67] While on the one hand it follows from the observations above that there are infinitely many Monge matrices, on the other hand the number of Monge matrices with small entries and distinct columns and distinct rows is rather small. More precisely, Klinz, Rudolf and Woeginger [86] have shown that a 0 1 Monge matrix C with no identical rows and columns is of order at most 4 Theta 3 or 3 Theta 4. This result carries over to Monge matrices with two different entries. Using similar arguments it can be shown that a Monge matrix with entries from the set f0; 1; kg and ....
B. Klinz, R. Rudolf and G.J. Woeginger, Permuting matrices to avoid forbidden submatrices, Discrete Applied Mathematics 60, 1995, 223--248.
Avoiding Forbidden Submatrices by Row Deletions - Wernicke, Alber, Gramm, Guo, .. (2004) (Correct)
No context found.
B. Klinz, R. Rudolf, and G. J. Woeginger. Permuting matrices to avoid forbidden submatrices. Discrete Applied Mathematics, 60:223--248, 1995.
On the Algorithmic Tractability of Single Nucleotide.. - Wernicke (2003) (Correct)
No context found.
B. Klinz, R. Rudolf, and G. J. Woeginger. Permuting matrices to avoid forbidden submatrices. Discrete Applied Mathematics, 60:223-248, 1995
Incomplete Directed Perfect Phylogeny - Itsik Pe'er Tal (Correct)
No context found.
B. Klinz, R. Rudolf, and G. J. Woeginger. Permuting matrices to avoid forbidden submatrices. Discrete applied mathematics, 60:223-248, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC