Pages that link to "Item:Q2499592"
From MaRDI portal
The following pages link to Fast algorithms for identifying maximal common connected sets of interval graphs (Q2499592):
Displaying 4 items.
- Common intervals and permutation reconstruction from \textit{MinMax}-betweenness constraints (Q1784981) (← links)
- Competitive graph searches (Q2481952) (← links)
- Determining DNA sequence similarity using maximum independent set algorithms for interval graphs (Q5056152) (← links)
- Combinatorial Pattern Matching (Q5315344) (← links)