max-cut and Containment Relations in Graphs (Q3057609): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-16926-7_4
+Normal rank
@@ Property / OpenAlex ID @@
+W1530503246
@@ Property / OpenAlex ID: W1530503246 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization via enumeration: A new algorithm for the max cut problem
+Normal rank
@@ Property / cites work @@
+On easy and hard hereditary classes of graphs with respect to the independent set problem
+Normal rank
@@ Property / cites work @@
+NP-hard graph problems and boundary classes of graphs
+Normal rank
@@ Property / cites work @@
+Boundary classes of graphs for the dominating set problem
+Normal rank
@@ Property / cites work @@
+A polynomial characterization of some graph partitioning problems
+Normal rank
@@ Property / cites work @@
+The max-cut problem on graphs not contractible to \(K_ 5\)
+Normal rank
@@ Property / cites work @@
+Quickly excluding a forest
@@ Property / cites work: Quickly excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Q4942616
@@ Property / cites work: Q4942616 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4500843
@@ Property / cites work: Q4500843 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
+Normal rank
@@ Property / cites work @@
+Q4411278
@@ Property / cites work: Q4411278 / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors
+Normal rank
@@ Property / cites work @@
+MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for the max-cut problem on graphs without long odd cycles
+Normal rank
@@ Property / cites work @@
+Weakly bipartite graphs and the max-cut problem
@@ Property / cites work: Weakly bipartite graphs and the max-cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q2816093
@@ Property / cites work: Q2816093 / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of weakly bipartite graphs
@@ Property / cites work: A characterization of weakly bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum cut on line and total graphs
@@ Property / cites work: Maximum cut on line and total graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Cut of a Planar Graph in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Q4448764
@@ Property / cites work: Q4448764 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum independent sets in subclasses of \(P_{5}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Q5659589
@@ Property / cites work: Q5659589 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273877
@@ Property / cites work: Q4273877 / rank @@
+Normal rank
@@ Property / cites work @@
+A short proof of Guenin's characterization of weakly bipartite graphs
+Normal rank
@@ Property / cites work @@
+Node-and edge-deletion NP-complete problems
@@ Property / cites work: Node-and edge-deletion NP-complete problems / rank @@
+Normal rank