Pages that link to "Item:Q2268880"
From MaRDI portal
The following pages link to On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (Q2268880):
Displaying 5 items.
- Inapproximability results related to monophonic convexity (Q499364) (← links)
- Simplified frequency response computation of fractional order systems with multiple linear uncertainty structures (Q1700274) (← links)
- Computing simple-path convex hulls in hypergraphs (Q1944079) (← links)
- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs (Q2118246) (← links)
- Parameterizing path partitions (Q6664058) (← links)
