Results 131 to 140 of about 428 (156)

An Implicit Enumeration Approach for Maximum Ratio Clique Relaxations

open access: yesNetworks, EarlyView.
ABSTRACT This article proposes an implicit enumeration approach to solve the maximum ratio s$$ s $$‐plex and the maximum ratio s$$ s $$‐defective clique problems. The approach is inspired by the classical Bron‐Kerbosch algorithm for enumerating all maximal cliques in a graph, which is extended to enumerating structures that are hereditary on induced ...
Yehor Blokhin   +4 more
wiley   +1 more source

Home - About - Disclaimer - Privacy