Next: Covering and Partitioning
Up: A compendium of NP
Previous: Improving the compendium
  Index
Graph Theory
- Covering and Partitioning
- MINIMUM VERTEX COVER
- MINIMUM DOMINATING SET
- MINIMUM EDGE DOMINATING SET
- MINIMUM INDEPENDENT DOMINATING SET
- MINIMUM GRAPH COLORING
- 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 EDGE DISJOINT CYCLE
COVER
- MINIMUM CUT COVER
- Subgraphs and Supergraphs
- MAXIMUM CLIQUE
- MAXIMUM INDEPENDENT SET
- MAXIMUM INDEPENDENT SEQUENCE
- MAXIMUM INDUCED SUBGRAPH WITH
PROPERTY P
- MINIMUM VERTEX DELETION TO OBTAIN
SUBGRAPH WITH PROPERTY P
- MINIMUM EDGE DELETION TO OBTAIN
SUBGRAPH WITH PROPERTY P
- MAXIMUM INDUCED CONNECTED
SUBGRAPH WITH PROPERTY P
- MINIMUM VERTEX DELETION TO
OBTAIN CONNECTED SUBGRAPH WITH PROPERTY P
- MAXIMUM DEGREE-BOUNDED
CONNECTED SUBGRAPH
- MAXIMUM PLANAR SUBGRAPH
- MINIMUM EDGE DELETION
K-PARTITION
- MAXIMUM K-COLORABLE SUBGRAPH
- MAXIMUM SUBFOREST
- MAXIMUM EDGE SUBGRAPH
- MINIMUM EDGE 2-SPANNER
- MAXIMUM K-COLORABLE
INDUCED SUBGRAPH
- MINIMUM EQUIVALENT DIGRAPH
- MINIMUM INTERVAL GRAPH
COMPLETION
- MINIMUM CHORDAL GRAPH
COMPLETION
- MINIMUM COLOR SUM
- Vertex Ordering
- MINIMUM BANDWIDTH
- MINIMUM DIRECTED BANDWIDTH
- MINIMUM LINEAR ARRANGEMENT
- MINIMUM CUT LINEAR ARRANGEMENT
- Iso- and Other Morphisms
- MAXIMUM COMMON SUBGRAPH
- MAXIMUM COMMON INDUCED
SUBGRAPH
- MAXIMUM COMMON EMBEDDED SUB-TREE
- MINIMUM GRAPH TRANSFORMATION
- Miscellaneous
- LONGEST PATH WITH FORBIDDEN
PAIRS
- SHORTEST PATH WITH FORBIDDEN
PAIRS
- MINIMUM POINT-TO-POINT CONNECTION
- MINIMUM METRIC DIMENSION
- MINIMUM TREE WIDTH
- MINIMUM GRAPH INFERENCE
|