Q5202209 (Q5202209): Difference between revisions

@@ Property / cites work @@
+Eigenvalues and expanders
@@ Property / cites work: Eigenvalues and expanders / rank @@
+Normal rank
@@ Property / cites work @@
+\(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
+Normal rank
@@ Property / cites work @@
+Eigenvalues of the Laplacian of a graph<sup>∗</sup>
+Normal rank
@@ Property / cites work @@
+The max-cut problem on graphs not contractible to \(K_ 5\)
+Normal rank
@@ Property / cites work @@
+An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
+Normal rank
@@ Property / cites work @@
+Q5682350
@@ Property / cites work: Q5682350 / 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 @@
+Finding a Maximum Cut of a Planar Graph in Polynomial Time
+Normal rank
@@ Property / cites work @@
+On the Shannon capacity of a graph
@@ Property / cites work: On the Shannon capacity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Ramanujan graphs
@@ Property / cites work: Ramanujan graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Isoperimetric numbers of graphs
@@ Property / cites work: Isoperimetric numbers of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4873761
@@ Property / cites work: Q4873761 / rank @@
+Normal rank
@@ Property / cites work @@
+A remark on max-cut problem with an application to digital-analogue convertors
+Normal rank
@@ Property / cites work @@
+Q5659589
@@ Property / cites work: Q5659589 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum bipartite subgraphs of Kneser graphs
@@ Property / cites work: Maximum bipartite subgraphs of Kneser graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
+Normal rank
@@ Property / cites work @@
+Q3682496
@@ Property / cites work: Q3682496 / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit Concentrators from Generalized <i>N</i>-Gons
+Normal rank