On the recognition of permuted bottleneck Monge matrices
- 27 October 1995
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 63 (1) , 43-74
- https://doi.org/10.1016/0166-218x(94)00019-a
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Permuting matrices to avoid forbidden submatricesDiscrete Applied Mathematics, 1995
- A Monge property for the d-dimensional transportation problemDiscrete Applied Mathematics, 1995
- Efficient parallel algorithms for bipartite permutation graphsNetworks, 1993
- Efficiently solvable special cases of bottleneck travelling salesman problemsDiscrete Applied Mathematics, 1991
- Monge sequences, antimatroids, and the transportation problem with forbidden arcsLinear Algebra and its Applications, 1990
- On the monge property of matricesDiscrete Mathematics, 1990
- An algorithm for the detection and construction of Monge sequencesLinear Algebra and its Applications, 1989
- Geometric applications of a matrix-searching algorithmAlgorithmica, 1987
- Recognition of Gilmore-Gomory traveling salesman problemDiscrete Applied Mathematics, 1986
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976