Graph Theory Toolbox

Some functions of graph theory

GrTheory - Graph Theory Toolbox.

Functions:

Packings:

maxindset - solve the maximum independent (stable) set problem for the graph.

maxmatch - solve the maximum matching problem for the graph.

Coverings:

minedgecover - solve the minimum edge cover problem for the graph.

minvercover - solve the minimum vertex cover problem for the graph.

Dominating sets:

mindomedgeset - solve the minimum dominating (absorbant) set problem for the graph edges.

mindomverset - solve the minimum dominating (absorbant) set problem for the graph vertices.

Cliques:

maxcompsub - solve the maximum complete subgraph problem for the graph.

Colorings:

minedgecolor - solve the minimum regular color problem for graph edges.

minvercolor - solve the minimum regular color problem for graph vertices.

Cycles and cocycles:

eulerianpath - find the Eulerian path or cycle of graph.

cocyclebasis - find all independent cut-sets for a connected graph.

Partial ordering:

orderstrongcomp - find the partial ordering of strongly connected components.

PERT:

pert - solve the project evaluation research task.

graphtest - test program for all functions.