Pages that link to "Item:Q3315282"

The following pages link to A polynomial algorithm for the max-cut problem on graphs without long odd cycles (Q3315282):

Displaying 20 items.

• \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
• Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
• The max-cut problem on graphs not contractible to \(K_ 5\) (Q593988) (← links)
• Intersections of largest bonds in \(k\)-connected graphs (Q1043581) (← links)
• A polynomial characterization of some graph partitioning problems (Q1108810) (← links)
• The line index and minimum cut of weighted graphs (Q1303736) (← links)
• Maximum cut on line and total graphs (Q1304481) (← links)
• Intersections of longest cycles in \(k\)-connected graphs (Q1386428) (← links)
• Largest circuits in matroids (Q1775736) (← links)
• Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs (Q2220841) (← links)
• Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
• Intersections of cycles in \(k\)-connected graphs (Q2354605) (← links)
• Pairs of largest circuits in 3-connected matroids (Q2459975) (← links)
• On deletions of largest bonds in graphs (Q2469991) (← links)
• max-cut and Containment Relations in Graphs (Q3057609) (← links)
• On the cut polytope (Q4726054) (← 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)
• (Q5202209) (← links)