Cuts and Connectivity

Denna tjänst avvecklas 2026-01-19. Läs mer här (länk)

Cuts and Connectivity

Denna tjänst avvecklas 2026-01-19. Läs mer här (länk)

Next: MAXIMUM CUT Up: Network Design Previous: MINIMUM UPGRADING SPANNING TREE Index

Cuts and Connectivity

MAXIMUM CUT
MINIMUM CROSSING NUMBER
MAXIMUM DIRECTED CUT
MAXIMUM K-CUT
MINIMUM NETWORK INHIBITION ON PLANAR GRAPHS
MINIMUM K-CUT
MINIMUM VERTEX K-CUT
MINIMUM MULTIWAY CUT
MINIMUM MULTI-CUT
MINIMUM RATIO-CUT
MINIMUM B-BALANCED CUT
MINIMUM B-VERTEX SEPARATOR
MINIMUM QUOTIENT CUT
MINIMUM K-VERTEX CONNECTED SUBGRAPH
MINIMUM K-EDGE CONNECTED SUBGRAPH
MINIMUM BICONNECTIVITY AUGMENTATION
MINIMUM STRONG CONNECTIVITY AUGMENTATION
MINIMUM BOUNDED DIAMETER AUGMENTATION

Viggo Kann
2000-03-20