Common Structured Patterns in Linear Graphs: Approximation and Combinatorics Guillaume Fertin1 ⋆ , Danny Hermelin2 ⋆⋆ , Romeo Rizzi3 ⋆ , and St´ephane Vialette4 ⋆ 1
2
LINA, Univ. Nantes, 2 rue de la Houssini`ere, Nantes, France
[email protected] Dpt. Computer Science, Univ. Haifa, Mount Carmel, Haifa, Israel
[email protected] 3 DIMI, Univ. Udine, Udine, Italy
[email protected] 4 LRI, UMR 8623, Univ. Paris-Sud, Orsay, France
[email protected]
Abstract. A linear graph is a graph whose vertices are linearly ordered. This linear ordering allows pairs of disjoint edges to be either preceding (