A general approach to avoiding two by two submatrices
type: Item
instance of: scholarly article
title: A general approach to avoiding two by two submatrices
zbMATH Open document ID: 0804.05014
DOI: 10.1007/BF02276883
author: Rüdiger Rudolf
author: Gerhard J. Woeginger
author: Vladimir G. Deineko
published in: Computing
publication date: 1994-09-01T00:00:00Z
Mathematics Subject Classification ID: 05B20
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 05A05
zbMATH DE Number: 627658
zbMATH Keywords: matrix
zbMATH Keywords: decision problem
zbMATH Keywords: polynomial time recognition algorithm
zbMATH Keywords: Monge matrices
zbMATH Keywords: Supnick matrices
zbMATH Keywords: NP-complete
MaRDI profile type: Publication
cites work: Q3956745
cites work: Special cases of travelling salesman problems and heuristics
cites work: Universal conditions for algebraic travelling salesman problems to be efficiently solvable
cites work: Q4198056
cites work: Polynomial graph-colorings
cites work: Totally-Balanced and Greedy Matrices
cites work: Permuting matrices to avoid forbidden submatrices
cites work: Q3915990
cites work: Doubly Lexical Orderings of Matrices
cites work: Q3219752
cites work: Three Partition Refinement Algorithms
cites work: A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
cites work: Extreme Hamiltonian lines
full work available at URL: https://doi.org/10.1007/bf02276883
OpenAlex ID: W2104979271
description: scientific article; zbMATH DE number 627658