Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Ly Orgo"'
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783030604394
WG
WG
In the Maximum Balanced Biclique Problem (MBB), we are given an n-vertex graph \(G=(V, E)\), and the goal is to find a balanced complete bipartite subgraph with q vertices on each side while maximizing q. The MBB problem is among the first known NP-h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9be1a4e9bc46609105d799c7b093e962
https://doi.org/10.1007/978-3-030-60440-0_19
https://doi.org/10.1007/978-3-030-60440-0_19
