Orlova, G. I.; Dorfman, Ya. G. Finding the maximum cut in a graph. (English. Russian original) Zbl 0247.05151 Eng. Cybern. 10, 502-504 (1972); translation from Izv. Akad. Nauk SSSR, Tekh. Kibern. 1972, No. 3, 155-159 (1972). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 40 Documents MSC: 05C35 Extremal problems in graph theory 05C10 Planar graphs; geometric and topological aspects of graph theory 05-04 Software, source code, etc. for problems pertaining to combinatorics PDFBibTeX XMLCite \textit{G. I. Orlova} and \textit{Ya. G. Dorfman}, Eng. Cybern. 10, 502--504 (1972; Zbl 0247.05151); translation from Izv. Akad. Nauk SSSR, Tekh. Kibern. 1972, No. 3, 155--159 (1972)