Pages that link to "Item:Q1603504"
From MaRDI portal
The following pages link to Algorithms for maximum weight induced paths (Q1603504):
Displaying 14 items.
- Lower and upper bounds for long induced paths in 3-connected planar graphs (Q290522) (← links)
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818) (← links)
- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs (Q1005252) (← links)
- On exact solution approaches for the longest induced path problem (Q1999389) (← links)
- Mim-width. I. Induced path problems (Q2174563) (← links)
- Spanners for bounded tree-length graphs (Q2383601) (← links)
- 3D-interval-filament graphs (Q2462403) (← links)
- New formulations and branch-and-cut procedures for the longest induced path problem (Q2669795) (← links)
- Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275) (← links)
- Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
- (Q5111880) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← links)
- Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893) (← links)
