Data Structures | |
| class | branchStable |
| Branch & bound implementation for stable (independent) node sets. More... | |
Functions | |
| virtual TNode | abstractMixedGraph::StableSet () throw () |
| TNode | abstractMixedGraph::Clique () throw () |
| TNode | abstractMixedGraph::VertexCover () throw () |
|
|
Compute a maximum cardinality clique.
|
|
|
Compute a maximum independent node set.
Reimplemented in abstractBiGraph. |
|
|
Compute a minimum vertex cover.
|