scientific article; zbMATH DE number 1880331

zbMATH Open1015.06001MaRDI QIDQ4798662

Heiko Goeman

Publication date: 12 March 2003

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

zbMATH Keywords

algorithms for decomposition of partially ordered setslongest common substrings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Partial orders, general (06A06) Nonnumerical algorithms (68W05) Combinatorics on words (68R15) Pattern recognition, speech recognition (68T10) Semigroups in automata theory, linguistics, etc. (20M35) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Computing methodologies for text processing; mathematical typography (68U15) Software, source code, etc. for problems pertaining to ordered structures (06-04) Research exposition (monographs, survey articles) pertaining to ordered structures (06-02)

Related Items (3)

Title not available (Why is that?) ⋮ Some optimal algorithms for decomposed partially ordered sets ⋮ Efficient splitting and merging algorithms for order decomposable problems.

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 Q4798662)