Pages that link to "Item:Q1062757"
From MaRDI portal
The following pages link to Solving NP-hard problems in 'almost trees': vertex cover (Q1062757):
Displaying 6 items.
- Heuristics for automated knowledge source integration and service composition (Q941554) (← links)
- Maximum weight independent set in trees (Q1101239) (← links)
- Approximability issues of guarding a set of segments (Q2855782) (← links)
- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT (Q5890956) (← links)
- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT (Q5892359) (← links)
- Distance-based covering problems for graphs of given cyclomatic number (Q6546588) (← links)
