Showing 1 - 10 of 12
The Maximum Balanced Subgraph Problem (MBSP) is the problem of finding a subgraph of a signed graph that is balanced and maximizes the cardinality of its vertex set. This paper is the first one to discuss applications of the MBSP arising in three different research areas: the detection of...
Persistent link: https://www.econbiz.de/10010753491
Persistent link: https://www.econbiz.de/10014234874
Persistent link: https://www.econbiz.de/10011906602
Persistent link: https://www.econbiz.de/10013173830
Persistent link: https://www.econbiz.de/10010530205
Persistent link: https://www.econbiz.de/10010530208
Persistent link: https://www.econbiz.de/10012293719
Persistent link: https://www.econbiz.de/10011796461
Persistent link: https://www.econbiz.de/10014532318
Persistent link: https://www.econbiz.de/10012132455