Pages that link to "Item:Q2344218"
From MaRDI portal
The following pages link to Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218):
Displaying 6 items.
- The advice complexity of a class of hard online problems (Q1693995) (← links)
- Dynamic node packing (Q2097666) (← links)
- An efficient local search framework for the minimum weighted vertex cover problem (Q2282264) (← links)
- Optimal Online Edge Coloring of Planar Graphs with Advice (Q2947032) (← links)
- Online Minimum Spanning Tree with Advice (Q5895056) (← links)
- Advice complexity of adaptive priority algorithms (Q6180750) (← links)
