scientific article

zbMATH Open1224.05003MaRDI QIDQ3077256FDOQ3077256

Dominique Rossin, Mathilde Bouvel

Publication date: 22 February 2011

Title of this publication is not available (Why is that?)

zbMATH Keywords

longest common pattern problem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Distance in graphs (05C12)

Cited In (6)

• Constructing separable Arnold snakes of Morse polynomials
• A fast algorithm for permutation pattern matching based on alternating runs
• A survey of the algorithmic aspects of modular decomposition
• Unknotted cycles
• Random assignments on sequentially dichotomous domains
• An algorithm computing combinatorial specifications of permutation classes

This page was built for publication:

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