Maximum cut (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Maximum cut" in English language version.

Last modified: 16:50:46, 2 October 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

2017doi.org

2^nd place

77semanticscholar.org

15^th place

8^th place

31worldcat.org

4^th place

31jstor.org

23^rd place

15^th place

22arxiv.org

49^th place

31^st place

22ams.org

434^th place

249^th place

11upenn.edu

784^th place

498^th place

11hdl.handle.net

66^th place

34^th place

ams.org (Global: 434^th place; English: 249^th place)

mathscinet.ams.org

Grötschel, Jünger & Reinelt (1987). Grötschel, M.; Jünger, M.; Reinelt, G. (1987), "Calculating exact ground states of spin glasses: a polyhedral approach", Heidelberg colloquium on glassy dynamics (Heidelberg, 1986), Lecture Notes in Phys., vol. 275, Springer, Berlin, pp. 325–353, doi:10.1007/BFb0057526, ISBN 3-540-17777-9, MR 0916885.
Sæther & Telle (2016). Sæther, Sigve Hortemo; Telle, Jan Arne (2016), "Between treewidth and clique-width", Algorithmica, 75 (1): 218–253, arXiv:1404.7758, doi:10.1007/s00453-015-0033-7, MR 3492064.

arxiv.org (Global: 49^th place; English: 31^st place)

Gutin & Yeo (2021). Gutin, G.; Yeo, A. (2021), "Lower Bounds for Maximum Weighted Cut", arXiv:2104.05536 [math.CO]{{cite arXiv}}: CS1 maint: overridden setting (link).
Sæther & Telle (2016). Sæther, Sigve Hortemo; Telle, Jan Arne (2016), "Between treewidth and clique-width", Algorithmica, 75 (1): 218–253, arXiv:1404.7758, doi:10.1007/s00453-015-0033-7, MR 3492064.

doi.org (Global: 2^nd place; English: 2^nd place)

Edwards (1973, 1975). Edwards, C. S. (1973), "Some extremal properties of bipartite subgraphs", Can. J. Math., 25 (3): 475–485, doi:10.4153/CJM-1973-048-x, S2CID 121925638. Edwards, C. S. (1975), "An improved lower bound for the number of edges in a largest bipartite subgraph", Recent Advances in Graph Theory, pp. 167–181.
Bylka, Idzik & Tuza (1999). Bylka, S.; Idzik, A.; Tuza, I. (1999), "Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erd6s inequality", Discrete Math., 194 (1–3): 39–58, doi:10.1016/S0012-365X(98)00115-0.
Crowston et al. (2014). Crowston, R.; Fellows, M.; Gutin, G.; Jones, M.; Kim, E. J.; Rosamond, F.; Ruzsa, I. Z.; Thomassé, S.; Yeo, A. (2014), "Satisfying more than half of a system of linear equations over GF(2): A multivariate approach", J. Comput. Syst. Sci., 80 (4): 687–696, doi:10.1016/j.jcss.2013.10.002.
Alon, Krivelevich & Sudakov (2005); Scott (2005); Zeng & Hou (2017). Scott, A. (2005), "Judicious partitions and related problems", Surveys in Combinatorics, London Mathematical Society Lecture Note Series, 327: 95–117. Zeng, Q.; Hou, J. (2017), "Bipartite Subgraphs of H-free Graphs", Bull. Aust. Math. Soc., 30 (3): 1–13, doi:10.1017/S0004972716001295.
Poljak & Turzik (1986). Poljak, S.; Turzik, Z. (1986), "A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound", Discrete Math., 58 (1): 99–104, doi:10.1016/0012-365X(86)90192-5.
Hadlock (1975). Hadlock, F. (1975), "Finding a Maximum Cut of a Planar Graph in Polynomial Time", SIAM J. Comput., 4 (3): 221–225, doi:10.1137/0204019.
Jansen et al. (2005). Jansen, Klaus; Karpinski, Marek; Lingas, Andrzej; Seidel, Eike (2005), "Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs", SIAM Journal on Computing, 35 (1): 110–119, doi:10.1137/s009753970139567x.
Grötschel, Jünger & Reinelt (1987). Grötschel, M.; Jünger, M.; Reinelt, G. (1987), "Calculating exact ground states of spin glasses: a polyhedral approach", Heidelberg colloquium on glassy dynamics (Heidelberg, 1986), Lecture Notes in Phys., vol. 275, Springer, Berlin, pp. 325–353, doi:10.1007/BFb0057526, ISBN 3-540-17777-9, MR 0916885.
Papadimitriou & Yannakakis (1991) prove MaxSNP-completeness. Papadimitriou, Christos H.; Yannakakis, Mihalis (1991), "Optimization, approximation, and complexity classes", Journal of Computer and System Sciences, 43 (3): 425–440, doi:10.1016/0022-0000(91)90023-X.
Khot et al. (2007). Khot, Subhash; Kindler, Guy; Mossel, Elchanan; O'Donnell, Ryan (2007), "Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?", SIAM Journal on Computing, 37 (1): 319–357, doi:10.1137/S0097539705447372, S2CID 2090495.
Håstad (2001); Trevisan et al. (2000). Håstad, Johan (2001), "Some optimal inapproximability results", Journal of the ACM, 48 (4): 798–859, doi:10.1145/502090.502098, S2CID 5120748. Trevisan, Luca; Sorkin, Gregory; Sudan, Madhu; Williamson, David (2000), "Gadgets, Approximation, and Linear Programming", Proceedings of the 37th IEEE Symposium on Foundations of Computer Science: 617–626.
Dunning, Gupta & Silberholz (2018). Dunning, Iain; Gupta, Swati; Silberholz, John (2018), "What works best when? A systematic evaluation of heuristics for Max-Cut and QUBO", INFORMS Journal on Computing, 30 (3): 608–624, doi:10.1287/ijoc.2017.0798, S2CID 485706.
Crowston, Jones & Mnich (2015). Crowston, R.; Jones, M.; Mnich, M. (2015), "Max-cut parameterized above the Edwards–Erdős bound", Algorithmica, 72 (3): 734–757, doi:10.1007/s00453-014-9870-z, S2CID 14973734.
Etscheid & Mnich (2018). Etscheid, M.; Mnich, M. (2018), "Linear Kernels and Linear-Time Algorithms for Finding Large Cuts", Algorithmica, 80 (9): 2574–2615, doi:10.1007/s00453-017-0388-z, hdl:11420/4693, S2CID 16301072.
Sæther & Telle (2016). Sæther, Sigve Hortemo; Telle, Jan Arne (2016), "Between treewidth and clique-width", Algorithmica, 75 (1): 218–253, arXiv:1404.7758, doi:10.1007/s00453-015-0033-7, MR 3492064.
Boykov & Jolly (2001). Boykov, Y.Y.; Jolly, M.-P. (2001), "Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images", Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001, vol. 1, IEEE Comput. Soc, pp. 105–112, doi:10.1109/iccv.2001.937505, ISBN 0-7695-1143-0, S2CID 2245438.
Barahona et al. (1988). Barahona, Francisco; Grötschel, Martin; Jünger, Michael; Reinelt, Gerhard (1988), "An application of combinatorial optimization to statistical physics and circuit layout design", Operations Research, 36 (3): 493–513, doi:10.1287/opre.36.3.493, ISSN 0030-364X, JSTOR 170992.

hdl.handle.net (Global: 66^th place; English: 34^th place)

Etscheid & Mnich (2018). Etscheid, M.; Mnich, M. (2018), "Linear Kernels and Linear-Time Algorithms for Finding Large Cuts", Algorithmica, 80 (9): 2574–2615, doi:10.1007/s00453-017-0388-z, hdl:11420/4693, S2CID 16301072.

jstor.org (Global: 23^rd place; English: 15^th place)

Barahona et al. (1988). Barahona, Francisco; Grötschel, Martin; Jünger, Michael; Reinelt, Gerhard (1988), "An application of combinatorial optimization to statistical physics and circuit layout design", Operations Research, 36 (3): 493–513, doi:10.1287/opre.36.3.493, ISSN 0030-364X, JSTOR 170992.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Edwards (1973, 1975). Edwards, C. S. (1973), "Some extremal properties of bipartite subgraphs", Can. J. Math., 25 (3): 475–485, doi:10.4153/CJM-1973-048-x, S2CID 121925638. Edwards, C. S. (1975), "An improved lower bound for the number of edges in a largest bipartite subgraph", Recent Advances in Graph Theory, pp. 167–181.
Khot et al. (2007). Khot, Subhash; Kindler, Guy; Mossel, Elchanan; O'Donnell, Ryan (2007), "Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?", SIAM Journal on Computing, 37 (1): 319–357, doi:10.1137/S0097539705447372, S2CID 2090495.
Håstad (2001); Trevisan et al. (2000). Håstad, Johan (2001), "Some optimal inapproximability results", Journal of the ACM, 48 (4): 798–859, doi:10.1145/502090.502098, S2CID 5120748. Trevisan, Luca; Sorkin, Gregory; Sudan, Madhu; Williamson, David (2000), "Gadgets, Approximation, and Linear Programming", Proceedings of the 37th IEEE Symposium on Foundations of Computer Science: 617–626.
Dunning, Gupta & Silberholz (2018). Dunning, Iain; Gupta, Swati; Silberholz, John (2018), "What works best when? A systematic evaluation of heuristics for Max-Cut and QUBO", INFORMS Journal on Computing, 30 (3): 608–624, doi:10.1287/ijoc.2017.0798, S2CID 485706.
Crowston, Jones & Mnich (2015). Crowston, R.; Jones, M.; Mnich, M. (2015), "Max-cut parameterized above the Edwards–Erdős bound", Algorithmica, 72 (3): 734–757, doi:10.1007/s00453-014-9870-z, S2CID 14973734.
Etscheid & Mnich (2018). Etscheid, M.; Mnich, M. (2018), "Linear Kernels and Linear-Time Algorithms for Finding Large Cuts", Algorithmica, 80 (9): 2574–2615, doi:10.1007/s00453-017-0388-z, hdl:11420/4693, S2CID 16301072.
Boykov & Jolly (2001). Boykov, Y.Y.; Jolly, M.-P. (2001), "Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images", Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001, vol. 1, IEEE Comput. Soc, pp. 105–112, doi:10.1109/iccv.2001.937505, ISBN 0-7695-1143-0, S2CID 2245438.

upenn.edu (Global: 784^th place; English: 498^th place)

repository.upenn.edu

Khot et al. (2007). Khot, Subhash; Kindler, Guy; Mossel, Elchanan; O'Donnell, Ryan (2007), "Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?", SIAM Journal on Computing, 37 (1): 319–357, doi:10.1137/S0097539705447372, S2CID 2090495.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Barahona et al. (1988). Barahona, Francisco; Grötschel, Martin; Jünger, Michael; Reinelt, Gerhard (1988), "An application of combinatorial optimization to statistical physics and circuit layout design", Operations Research, 36 (3): 493–513, doi:10.1287/opre.36.3.493, ISSN 0030-364X, JSTOR 170992.

Maximum cut (English Wikipedia)

ams.org (Global: 434th place; English: 249th place)

mathscinet.ams.org

arxiv.org (Global: 49th place; English: 31st place)

doi.org (Global: 2nd place; English: 2nd place)

hdl.handle.net (Global: 66th place; English: 34th place)

jstor.org (Global: 23rd place; English: 15th place)

semanticscholar.org (Global: 15th place; English: 8th place)