Pages that link to "Item:Q975443"
From MaRDI portal
The following pages link to A note on computing set overlap classes (Q975443):
Displaying 5 items.
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- A bound on the overlap of same-sized subsets (Q1021379) (← links)
- Systems of overlap representation for families of intervals (Q2115149) (← links)
- A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs (Q2672614) (← links)
- Consecutive Ones Property Testing: Cut or Swap (Q3091461) (← links)