Pages that link to "Item:Q5002610"
From MaRDI portal
The following pages link to Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (Q5002610):
Displaying 4 items.
- Fixed parameter tractability of graph deletion problems over data streams (Q2019516) (← links)
- (Q5875456) (← links)
- Revisiting maximum satisfiability and related problems in data streams (Q6113841) (← links)
- Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams (Q6185609) (← links)