Pages that link to "Item:Q2947027"
From MaRDI portal
The following pages link to Algorithms Solving the Matching Cut Problem (Q2947027):
Displaying 7 items.
- Algorithms solving the matching cut problem (Q897900) (← links)
- Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← links)
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (Q2192064) (← links)
- The complexity of the matching-cut problem for planar graphs and other graph classes (Q3652545) (← links)
- (Q5202835) (← links)
- Matching cutsets in graphs (Q5203060) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902513) (← links)