Extracting constrained 2-interval subsets in 2-interval sets
From MaRDI portal
Publication:2456375
DOI10.1016/j.tcs.2007.07.002zbMath1125.68085OpenAlexW1994563100MaRDI QIDQ2456375
Guillaume Fertin, Stéphane Vialette, Guillaume Blin
Publication date: 18 October 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.07.002
Related Items (5)
Finding common structured patterns in linear graphs ⋮ On the parameterized complexity of multiple-interval graph problems ⋮ Parameterized complexity of two-interval pattern problem ⋮ On recovering syntenic blocks from comparative maps ⋮ On Recovering Syntenic Blocks from Comparative Maps
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Trapezoid graphs and generalizations, geometry and algorithms
- Recognizing graphs with fixed interval number is NP-complete
- Approximating the 2-interval pattern problem
- Trapezoid graphs and their coloring
- On computing the length of longest increasing subsequences
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
- On the computational complexity of 2-interval pattern matching problems
- Incidence matrices and interval graphs
- On double and multiple interval graphs
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Extremal Values of the Interval Number of a Graph
- Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
- Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
- Combinatorial Pattern Matching
This page was built for publication: Extracting constrained 2-interval subsets in 2-interval sets
