Pages that link to "Item:Q5961618"
From MaRDI portal
The following pages link to On intervalizing \(k\)-colored graphs for DNA physical mapping (Q5961618):
Displaying 17 items.
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Unit interval editing is fixed-parameter tractable (Q515577) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- A short note on the complexity of computing strong pathbreadth (Q1705708) (← links)
- The Turing way to parameterized complexity (Q1877697) (← links)
- DNA physical mapping and alternating Eulerian cycles in colored graphs (Q1902468) (← links)
- Completing colored graphs to meet a target property (Q2030434) (← links)
- Bipartite completion of colored graphs avoiding chordless cycles of given lengths (Q2146743) (← links)
- Some completion problems for graphs without chordless cycles of prescribed lengths (Q2274074) (← links)
- NP-completeness results for edge modification problems (Q2500532) (← links)
- Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems (Q3467861) (← links)
- (Q4422493) (← links)
- Improved Lower Bounds for Graph Embedding Problems (Q5283358) (← links)
- (Q5708487) (← links)
- Complexity classification of some edge modification problems (Q5948964) (← links)
- On intervalizing \(k\)-colored graphs for DNA physical mapping (Q5961618) (← links)
