Pages that link to "Item:Q5056152"
From MaRDI portal
The following pages link to Determining DNA sequence similarity using maximum independent set algorithms for interval graphs (Q5056152):
Displayed 14 items.
- The disruptive anti-covering location problem (Q320083) (← links)
- Efficient chaining of seeds in ordered trees (Q450556) (← links)
- On the parameterized complexity of some optimization problems related to multiple-interval graphs (Q606990) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- Three ways to cover a graph (Q898135) (← links)
- Facets for node packing (Q1278997) (← links)
- Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← links)
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) (← links)
- Extracting constrained 2-interval subsets in 2-interval sets (Q2456375) (← links)
- Lagrangean relaxation with clusters for point-feature cartographic label placement problems (Q2468473) (← links)
- The Local Queue Number of Graphs with Bounded Treewidth (Q5014102) (← links)
- On \(H\)-topological intersection graphs (Q5925535) (← links)
- Temporal interval cliques and independent sets (Q6039892) (← links)
- Recognizing Proper Tree-Graphs (Q6089652) (← links)