# Category:Computational problems in graph theory

Computing portal |

Here is a list of articles in the category **Computational problems in graph theory** of the Computing portal that unifies foundations of mathematics and computations using computers. This category lists computational problems that arise in graph theory.

## Pages in category "Computational problems in graph theory"

The following 71 pages are in this category, out of 71 total.

### C

- Canadian traveller problem
*(computing)* - Clique cover
*(computing)* - Clique problem
*(computing)* - Connected dominating set
*(computing)* - Correlation clustering
*(computing)*

### D

- Degree diameter problem
*(computing)* - Deterministic rendezvous problem
*(computing)* - Bipartite realization problem
*(computing)* - Digraph realization problem
*(computing)* - Domatic number
*(computing)* - Dominating set
*(computing)*

### E

- Edge cover
*(computing)* - Edge dominating set
*(computing)*

### F

- Facility location problem
*(organization)* - Feedback arc set
*(computing)* - Feedback vertex set
*(computing)* - Frequent subtree mining
*(computing)*

### G

- Good spanning tree
*(computing)* - Graph coloring
*(computing)* - Graph cut optimization
*(computing)* - Graph cuts in computer vision
*(computing)* - Graph edit distance
*(computing)* - Graph isomorphism problem
*(computing)* - Graph matching
*(computing)* - Graph partition
*(computing)* - Graph realization problem
*(computing)* - Graph sandwich problem
*(computing)*

### H

- Hamiltonian path
*(computing)* - Hamiltonian cycle polynomial
*(computing)* - Hamiltonian path problem
*(computing)*

### I

- Independent set (graph theory)
*(computing)* - Induced subgraph isomorphism problem
*(computing)* - Instant Insanity
*(computing)*

### K

- K shortest path routing
*(computing)*

### L

- Longest path problem
*(computing)* - Longest uncrossed knight's path
*(computing)*

### M

- Matching (graph theory)
*(computing)* - MaxDDBS
*(computing)* - Maximal independent set
*(computing)* - Maximum agreement subtree problem
*(computing)* - Maximum common edge subgraph
*(computing)* - Maximum common induced subgraph
*(computing)* - Maximum cut
*(computing)* - Maximum flow problem
*(computing)* - Maximum weight matching
*(computing)* - Metric k-center
*(computing)* - Minimum k-cut
*(computing)* - Multi-trials technique
*(computing)*

### N

- Network simplex algorithm
*(computing)* - Nonblocker
*(computing)* - Nondeterministic constraint logic
*(computing)*

### O

- Odd cycle transversal
*(computing)*

### P

- Pebble motion problems
*(computing)* - Planarity testing
*(computing)* - Planted clique
*(computing)*

### Q

- Quadratic pseudo-Boolean optimization
*(computing)*

### R

- Radio coloring
*(computing)* - Route inspection problem
*(computing)*

### S

- Seidel's algorithm
*(computing)* - Set TSP problem
*(computing)* - Shortest path problem
*(computing)* - Snake-in-the-box
*(computing)* - Spanning tree
*(computing)* - Steiner tree problem
*(computing)* - Subgraph isomorphism problem
*(computing)*

### T

- Token reconfiguration
*(computing)* - Travelling salesman problem
*(computing)*

### V

- Vertex cover
*(computing)* - Vertex cycle cover
*(computing)*

### W

- Widest path problem
*(computing)* - Wiener connector
*(computing)*