Category

Computational problems in graph theory

page 1

travelling salesperson problem

NP-hard problem in combinatorial optimization

assignment of colors to elements of a graph subject to certain constraints

Hamiltonian path

path in a graph that visits each vertex exactly once

subgraph of an undirected graph G that is a tree which includes all of the vertices of G

independent set

set of vertices in a graph, no two of which are adjacent

shortest path problem

problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized

set of edges without common vertices

route inspection problem

in graph theory, the problem to find a shortest closed path or circuit that visits every edge of an undirected graph

maximum flow problem

computational problem in graph theory

computational problem of finding cliques in a graph

a set of vertices in a node-link graph such that every vertex is either in the set or adjacent to it

Steiner tree problem

class of problems in combinatorial mathematics

a set of vertices that includes at least one endpoint of every edge in a graph

longest path problem

the problem of finding a simple path of maximum length in a given graph

Hamiltonian path problem

computational problem in graph theory

a cut of a graph whose size is at least the size of any other cut

a set of edges that touches every vertex of a graph

subgraph isomorphism problem

the NP-complete problem of testing whether one graph is a subgraph of another

graph partition

subdivision of vertices into disjoint sets

clique cover problem

problem of finding a minimal clique cover of a given graph

graph isomorphism problem

computational problem of determining whether two finite graphs are isomorphic

planarity testing

algorithmic problem of testing whether a given graph is a planar graph

feedback vertex set

a set of vertices in a node-link graph whose deletion eliminates all cycles in the graph

Facility location

optimization problem

Feedback arc set

a subset of the edges in a directed graph that includes at least one edge from each cycle

degree diameter problem

problem in graph theory

maximal independent set

independent set of graph vertices that is not a subset of any other independent set

widest path problem

problem of maximizing the weight of the minimum-weight edge in the path between two vertices

longest distance between two vertices in a graph