Pages that link to "Item:Q897878"
From MaRDI portal
The following pages link to Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (Q897878):
Displayed 19 items.
- A refined algorithm for maximum independent set in degree-4 graphs (Q1680494) (← links)
- Exact exponential algorithms for 3-machine flowshop scheduling problems (Q1743653) (← links)
- Finding near-optimal independent sets at scale (Q2401330) (← links)
- Scale reduction techniques for computing maximum induced bicliques (Q2633172) (← links)
- Reinforcement learning for combinatorial optimization: a survey (Q2669503) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
- Solving vertex cover in polynomial time on hyperbolic random graphs (Q2701066) (← links)
- On the Power of Simple Reductions for the Maximum Independent Set Problem (Q2817877) (← links)
- A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs (Q2958106) (← links)
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments (Q5009617) (← links)
- From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial) (Q5090451) (← links)
- Data Reduction for Maximum Matching on Real-World Graphs (Q5102046) (← links)
- An Updated Experimental Evaluation of Graph Bipartization Methods (Q5102059) (← links)
- (Q5140722) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- (Q5874530) (← links)
- Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry (Q6066757) (← links)
- Research trends in combinatorial optimization (Q6091419) (← links)
- A probabilistic algorithm for vertex cover (Q6144024) (← links)