Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs

DOI10.1007/11780441_25zbMath1196.68352MaRDI QIDQ5307512

Alexander Tiskin

Publication date: 14 September 2007

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780441_25

Mathematics Subject Classification ID

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

68W32: Algorithms on strings

Related Items

Finding common structured patterns in linear graphs