Pages that link to "Item:Q434180"
From MaRDI portal
The following pages link to Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180):
Displaying 12 items.
- On cuts and matchings in planar graphs (Q688915) (← links)
- Partitioning graphs on message-passing machines by pairwise mincut (Q1818794) (← links)
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs (Q2220841) (← links)
- Partition into almost straight trails (Q2434726) (← links)
- Efficient polynomial-time algorithms for special graph partitioning problems (Q2877347) (← links)
- (Q3325466) (← links)
- Solving minimum K-cardinality cut problems in planar graphs (Q3418207) (← links)
- Introduction to QUBO (Q5050141) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- Quantum Annealing versus Digital Computing (Q5102052) (← links)
- Maximum Cut Parameterized by Crossing Number (Q5119374) (← links)
- Optimization via enumeration: A new algorithm for the max cut problem (Q5935710) (← links)