Pages that link to "Item:Q2424831"
From MaRDI portal
The following pages link to The connected vertex cover problem in \(k\)-regular graphs (Q2424831):
Displaying 10 items.
- The ferry cover problem on regular graphs and small-degree graphs (Q1624206) (← links)
- An efficient heuristic algorithm for solving connected vertex cover problem (Q1720833) (← links)
- Complexity and algorithms for the connected vertex cover problem in 4-regular graphs (Q1735245) (← links)
- Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← links)
- Algorithms and complexity for a class of combinatorial optimization problems with labelling (Q2031932) (← links)
- Connected Vertex Covers in Dense Graphs (Q3541785) (← links)
- Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5915592) (← links)
- Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)
- Algorithms and hardness results for edge total domination problem in graphs (Q6199394) (← links)
- Eternal connected vertex cover problem in graphs: complexity and algorithms (Q6547830) (← links)