A Branch-And-Cut Algorithm for the Maximum K-Balanced Subgraph of a Signed Graph

AuthID
P-015-D7J
3
Author(s)
Frota, Y
·
Labbé, M
Tipo de Documento
Article
Year published
2019
Publicado
in Discrete Applied Mathematics, ISSN: 0166-218X
Volume: 261, Páginas: 164-185
Indexing
Publication Identifiers
Source Identifiers
ISSN: 0166-218X
Export Publication Metadata
Info
At this moment we don't have any links to full text documens.