A folding preprocess for the max k-cut problem
Sign Up to like & getrecommendations! Published in 2025 at "Optimization Letters"
DOI: 10.1007/s11590-025-02199-0
Abstract: Given graph G=(V,E)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G=(V,E)$$\end{document} with vertex set V and edge set E, the max k-cut problem seeks to partition the vertex set V into at most k… read more here.
Keywords: max cut; preprocess; problem; cut problem ... See more keywords
Bioinspired Quantum Oracle Circuits for Biomolecular Solutions of the Maximum Cut Problem
Sign Up to like & getrecommendations! Published in 2024 at "IEEE Transactions on NanoBioscience"
DOI: 10.1109/tnb.2024.3395420
Abstract: Given an undirected, unweighted graph with n vertices and m edges, the maximum cut problem is to find a partition of the n vertices into disjoint subsets ${V}_{{1}}$ and ${V}_{{2}}$ such that the number of… read more here.
Keywords: maximum cut; cut problem; tex math; inline formula ... See more keywords
Solving the maximum cut problem using Harris Hawk Optimization algorithm
Sign Up to like & getrecommendations! Published in 2024 at "PLOS ONE"
DOI: 10.1371/journal.pone.0315842
Abstract: The objective of the max-cut problem is to cut any graph in such a way that the total weight of the edges that are cut off is maximum in both subsets of vertices that are… read more here.
Keywords: problem; using harris; cut problem; cut ... See more keywords