Pages that link to "Item:Q3627967"
From MaRDI portal
The following pages link to Algorithm Engineering for Optimal Graph Bipartization (Q3627967):
Displaying 17 items.
- On bipartization of cubic graphs by removal of an independent set (Q298966) (← links)
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (Q897878) (← links)
- Resilience and optimization of identifiable bipartite graphs (Q1941385) (← links)
- Faster graph bipartization (Q2301359) (← links)
- Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization (Q2437764) (← links)
- Another disjoint compression algorithm for odd cycle transversal (Q2445321) (← links)
- Planar graph bipartization in linear time (Q2482113) (← links)
- Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs (Q2689443) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving (Q2908532) (← links)
- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs (Q3656864) (← links)
- An Updated Experimental Evaluation of Graph Bipartization Methods (Q5102059) (← links)
- Hitting Selected (Odd) Cycles (Q5348214) (← links)
- Experimental and Efficient Algorithms (Q5710023) (← links)
- Experimental and Efficient Algorithms (Q5710033) (← links)
- (Q5743380) (← links)