RUS  ENG
Full version
JOURNALS // Meždunarodnyj naučno-issledovatel'skij žurnal // Archive

Meždunar. nauč.-issled. žurn., 2013 Issue 8(15), Pages 5–6 (Mi irj476)

PHYSICS AND MATHEMATICS

Finding the Beta cycle in a graph – NP-complete problem

A. N. Belash

North-Caucasus Federal University

Abstract: The article considers the proof of NP-completeness of the problem of finding the Beta cycle in a graph.

Keywords: graph theory, cycles, NP-completeness.



© Steklov Math. Inst. of RAS, 2024