Publication:3077256
From MaRDI portal
zbMath1224.05003MaRDI QIDQ3077256
Dominique Rossin, Mathilde Bouvel
Publication date: 22 February 2011
Trees (05C05) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
A fast algorithm for permutation pattern matching based on alternating runs, Random assignments on sequentially dichotomous domains, A survey of the algorithmic aspects of modular decomposition, An algorithm computing combinatorial specifications of permutation classes, Constructing separable Arnold snakes of Morse polynomials, Unknotted cycles