Pages that link to "Item:Q1169411"
From MaRDI portal
The following pages link to Weakly bipartite graphs and the max-cut problem (Q1169411):
Displayed 50 items.
- A nonmonotone GRASP (Q340011) (← links)
- Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453) (← links)
- \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
- Faster separation of 1-wheel inequalities by graph products (Q496437) (← links)
- Finding a shortest non-zero path in group-labeled graphs via permanent computation (Q524371) (← links)
- The max-cut problem on graphs not contractible to \(K_ 5\) (Q593988) (← links)
- Small bipartite subgraph polytopes (Q613319) (← links)
- Separator-based data reduction for signed graph balancing (Q613659) (← links)
- Finding a shortest cycle in a subspace of the cycle space of a graph (Q668125) (← links)
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs (Q686456) (← links)
- On some weakly bipartite graphs (Q800231) (← links)
- A fast algorithm for minimum weight odd circuits and cuts in planar graphs (Q813970) (← links)
- Optimal cuts in graphs and statistical mechanics (Q967941) (← links)
- Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem (Q969344) (← links)
- The complexity of determining a shortest cycle of even length (Q1052821) (← links)
- \(K_ i\)-covers. I: Complexity and polytopes (Q1070249) (← links)
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound (Q1071037) (← links)
- A remark on max-cut problem with an application to digital-analogue convertors (Q1071657) (← links)
- An efficient Dijkstra-like labeling method for computing shortest odd/even paths (Q1072571) (← links)
- A note on line digraphs and the directed max-cut problem (Q1174433) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- On a composition of independence systems by circuit identification (Q1186136) (← links)
- Compositions in the bipartite subgraph polytope (Q1199475) (← links)
- Facets for the cut cone. I (Q1199749) (← links)
- Role of redundant constraints for improving dual bounds in polynomial optimization problems (Q1288665) (← links)
- The line index and minimum cut of weighted graphs (Q1303736) (← links)
- Laplacian eigenvalues and the maximum cut problem (Q1319025) (← links)
- Separating multi-oddity constrained shortest circuits over the polytope of stable multisets. (Q1417599) (← links)
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables (Q1628128) (← links)
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts (Q1814791) (← links)
- A characterization of weakly bipartite graphs (Q1850558) (← links)
- A short proof of Guenin's characterization of weakly bipartite graphs (Q1850611) (← links)
- Applications of cut polyhedra. II (Q1891020) (← links)
- Facets of the \(k\)-partition polytope (Q1897366) (← links)
- New algorithms for the weighted maximum cut problem on graphs (Q1907796) (← links)
- Graphic vertices of the metric polytope (Q1916387) (← links)
- The minimum chromatic violation problem: a polyhedral approach (Q2184668) (← links)
- Cuts in undirected graphs. I (Q2215599) (← links)
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs (Q2220841) (← links)
- On fractional cut covers (Q2312658) (← links)
- Even-cycle decompositions of graphs with no odd-\(K_4\)-minor (Q2400967) (← links)
- Polyhedral results for the bipartite induced subgraph problem (Q2433802) (← links)
- From Graph Orientation to the Unweighted Maximum Cut (Q2817879) (← links)
- max-cut and Containment Relations in Graphs (Q3057609) (← links)
- A polynomial algorithm for the max-cut problem on graphs without long odd cycles (Q3315282) (← links)
- Fractional covering by cuts (Q3439381) (← links)
- A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams (Q3656849) (← links)
- Solving matching problems with linear programming (Q3703653) (← links)
- Binary group and Chinese postman polyhedra (Q3717740) (← links)
- LP extreme points and cuts for the fixed-charge network design problem (Q3778564) (← links)