Pages that link to "Item:Q1304481"
From MaRDI portal
The following pages link to Maximum cut on line and total graphs (Q1304481):
Displaying 16 items.
- \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (Q509888) (← links)
- Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\) (Q830923) (← links)
- The maximum cardinality cut problem in co-bipartite chain graphs (Q1698075) (← links)
- A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs (Q1748508) (← links)
- A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs (Q2034399) (← links)
- On the maximum cardinality cut problem in proper interval graphs and related graph classes (Q2055967) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- max-cut and Containment Relations in Graphs (Q3057609) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs (Q5886117) (← links)
- Complexity of maximum cut on interval graphs (Q6174803) (← links)
- Canonical cuts of path powers (Q6641096) (← links)
