Maximum cut (English Wikipedia)

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

refsWebsite

Global rank English rank

17doi.org

2^nd place

8semanticscholar.org

11^th place

8^th place

1arxiv.org

69^th place

59^th place

1psu.edu

207^th place

136^th place

1upenn.edu

702^nd place

520^th place

1handle.net

102^nd place

76^th place

1worldcat.org

5^th place

1jstor.org

26^th place

20^th place

arxiv.org

Gutin & Yeo (2021). Gutin, G.; Yeo, A. (2021), "Lower Bounds for Maximum Weighted Cut", arXiv:2104.05536 [math.CO].

doi.org

Edwards (1973). 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.
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: 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). Alon, N.; Krivelevich, M.; Sudakov, B. (2005), "Maxcut in H-free graphs", Combin. Probab. Comput., 14: 629–647, doi:10.1017/S0963548305007017, S2CID 123485000.
Zeng & Hou (2017). 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, CiteSeerX 10.1.1.62.5082, doi:10.1137/s009753970139567x.
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) Håstad, Johan (2001), "Some optimal inapproximability results", Journal of the ACM, 48 (4): 798–859, doi:10.1145/502090.502098, S2CID 5120748.
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, 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, 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.

dx.doi.org

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.

handle.net

hdl.handle.net

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

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.

psu.edu

citeseerx.ist.psu.edu

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, CiteSeerX 10.1.1.62.5082, doi:10.1137/s009753970139567x.

semanticscholar.org

api.semanticscholar.org

Edwards (1973). 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.
Alon, Krivelevich & Sudakov (2005). Alon, N.; Krivelevich, M.; Sudakov, B. (2005), "Maxcut in H-free graphs", Combin. Probab. Comput., 14: 629–647, doi:10.1017/S0963548305007017, S2CID 123485000.
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) Håstad, Johan (2001), "Some optimal inapproximability results", Journal of the ACM, 48 (4): 798–859, doi:10.1145/502090.502098, S2CID 5120748.
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, 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

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

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.