Finding common structured patterns in linear graphs

DOI10.1016/J.TCS.2010.02.017zbMATH Open1209.68367OpenAlexW2000491730MaRDI QIDQ974741FDOQ974741

Danny Hermelin, Stéphane Vialette, Guillaume Fertin, Romeo Rizzi

Publication date: 7 June 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.02.017

zbMATH Keywords

approximationlinear graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient algorithms for interval graphs and circular-arc graphs
• A faster algorithm computing string edit distances
• Pattern matching for permutations
• Crossings and nestings of matchings and partitions
• Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
• A decomposition theorem for partially ordered sets
• A fast algorithm for computing longest common subsequences
• The Complexity of Some Problems on Subsequences and Supersequences
• Sparse dynamic programming I
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• Ordered and Unordered Tree Inclusion
• Covering and coloring polygon-circle graphs
• More Efficient Algorithm for Ordered Tree Inclusion
• Approximation of RNA Multiple Structural Alignment
• An Optimal Decomposition Algorithm for Tree Edit Distance
• The longest common subsequence problem revisited
• Algorithms for the Longest Common Subsequence Problem
• Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
• On the computational complexity of 2-interval pattern matching problems
• A computational model for RNA multiple structural alignment
• On two open problems of 2-interval patterns
• Extracting constrained 2-interval subsets in 2-interval sets
• What Makes the Arc-Preserving Subsequence Problem Hard?
• Algorithms – ESA 2005

Cited In (2)

• Near-Regular Structure Discovery Using Linear Programming
• Finding patterns in an unknown graph

This page was built for publication: Finding common structured patterns in linear graphs

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