Pages that link to "Item:Q331987"
From MaRDI portal
The following pages link to Searching for a cycle with maximum coverage in undirected graphs (Q331987):
Displaying 5 items.
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
- A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
- On approximating maximum covering cycles in undirected graphs (Q2414126) (← links)
- Approximating maximum weight cycle covers in directed graphs with weights zero and one (Q2483998) (← links)
- Finding even cycles faster via capped k-walks (Q4977965) (← links)