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
Document Type
Article
Year published
2019
Published
in Discrete Applied Mathematics, ISSN: 0166-218X
Volume: 261, Pages: 164-185
Indexing
Crossref®1
Google Scholar®
Publication Identifiers
Source Identifiers
ISSN: 0166-218X
Export Publication Metadata
Marked List
 Add to Marked List
Info
At this moment we don't have any links to full text documens.

footer slogan

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service