Covering and Partitioning

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

Covering and Partitioning

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

Next: MINIMUM VERTEX COVER Up: Graph Theory Previous: Graph Theory Index

Covering and Partitioning

MINIMUM VERTEX COVER
MINIMUM DOMINATING SET
MAXIMUM DOMATIC PARTITION
MINIMUM EDGE DOMINATING SET
MINIMUM INDEPENDENT DOMINATING SET
MINIMUM GRAPH COLORING
MINIMUM COLOR SUM
MAXIMUM ACHROMATIC NUMBER
MINIMUM EDGE COLORING
MINIMUM FEEDBACK VERTEX SET
MINIMUM FEEDBACK ARC SET
MINIMUM MAXIMAL MATCHING
MAXIMUM TRIANGLE PACKING
MAXIMUM H-MATCHING
MINIMUM BOTTLENECK PATH MATCHING
MINIMUM CLIQUE PARTITION
MINIMUM K-CAPACITATED TREE PARTITION
MAXIMUM BALANCED CONNECTED PARTITION
MINIMUM CLIQUE COVER
MINIMUM COMPLETE BIPARTITE SUBGRAPH COVER
MINIMUM VERTEX DISJOINT CYCLE COVER
MINIMUM CUT COVER

Viggo Kann
2000-03-20