Optirefine: densest subgraphs and maximum cuts with k refinements
Sign Up to like & getrecommendations! Published in 2025 at "Data Mining and Knowledge Discovery"
DOI: 10.1007/s10618-025-01142-2
Abstract: Data-analysis tasks often involve an iterative process, which requires refining previous solutions. For instance, when analyzing social networks, we may obtain initial communities based on noisy metadata, and we want to improve them by adding… read more here.
Keywords: densest subgraph; document; maximum cut; optirefine densest ... 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