Defragmentation of permutation tables with four columns

DOI10.1515/DMA.2009.035MaRDI QIDQ3225893zbMATH OpenFDO

Authors Abdulkarim M. Magomedov

Publication date 23 March 2012

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/DMA.2009.035

zbMATH Keywords

conditions of defragmentation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics in computer science (68R05) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Publication:5753965
• On the matrix permutation problem
• Finding the permutations corresponding to a given Young tableau
• Publication:3199202
• Permuting matrices to avoid forbidden submatrices

Cites work

• A note on the consecutive ones submatrix problem.
• On the Complexity of Timetable and Multicommodity Flow Problems
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

This page was built for publication: Defragmentation of permutation tables with four columns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225893)