Pages that link to "Item:Q2971630"
From MaRDI portal
The following pages link to Polynomial Time Algorithms for Bichromatic Problems (Q2971630):
Displaying 6 items.
- Biclique-colouring verification complexity and biclique-colouring power graphs (Q491598) (← links)
- Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice (Q841618) (← links)
- Variations of largest rectangle recognition amidst a bichromatic point set (Q2201768) (← links)
- On the bichromatic <i>k</i> -set problem (Q2930344) (← links)
- (Q5501327) (← links)
- Monochromatic partitioning of colored points by lines (Q6161462) (← links)