The following pages link to (Q5463498):
Displayed 19 items.
- Augmenting approach for some maximum set problems (Q284765) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941) (← links)
- A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
- Minimum \(k\)-path vertex cover (Q2275922) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- The \(k\)-path vertex cover of rooted product graphs (Q2348061) (← links)
- The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
- On the vertex \(k\)-path cover (Q2446837) (← links)
- 3D-interval-filament graphs (Q2462403) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575) (← links)
- Uniformly dissociated graphs (Q4604516) (← links)
- (Q4691867) (← links)
- (Q4691905) (← links)
- (Q4691914) (← links)
- (Q4961733) (← links)