Algorithms and Computation
From MaRDI portal
Publication:5897848
DOI10.1007/11602613zbMath1173.68836OpenAlexW2304246803MaRDI QIDQ5897848
Michel A. Habib, Binh-Minh Bui-Xuan, Christophe Paul
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11602613
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Permutations, words, matrices (05A05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
Some families of trees arising in permutation analysis ⋮ Fully dynamic representations of interval graphs ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ A more efficient algorithm for perfect sorting by reversals ⋮ An algorithm for deciding the finiteness of the number of simple permutations in permutation classes ⋮ Competitive graph searches ⋮ Common intervals and permutation reconstruction from \textit{MinMax}-betweenness constraints ⋮ Fully dynamic algorithm for recognition and modular decomposition of permutation graphs ⋮ Algorithmic aspects of a general modular decomposition theory
This page was built for publication: Algorithms and Computation
