Integer programming models for detecting graph bipartitions with structural requirements
Sign Up to like & getrecommendations! Published in 2018 at "Networks"
DOI: 10.1002/net.21786
Abstract: The graph bipartitioning problem consists of dividing a graph into two disjoint subgraphs, such that each node is highly similar to others in the same subgraph, but also different from members of the other subgraph,… read more here.
Keywords: programming models; graph bipartitions; problem; models detecting ... See more keywords