Find link

language:

Find link is a tool written by Edward Betts.

searching for Mixed graph 4 found (14 total)

Mixed Chinese postman problem (2,123 words) [view diff] exact match in snippet view article find links to article

bidirectional and can be plowed in both directions. It is easy to check if a mixed graph has a postman tour of any size by verifying if the graph is strongly

Capacitated arc routing problem (1,027 words) [view diff] exact match in snippet view article find links to article

finding the shortest tour with a minimum graph/travel distance of a mixed graph with undirected edges and directed arcs given capacity constraints for

Hermitian matrix (3,028 words) [view diff] exact match in snippet view article find links to article

analyze the spectra of mixed graphs. The Hermitian-adjacency matrix of a mixed graph is another important concept, as it is a Hermitian matrix that plays

Strong orientation (1,858 words) [view diff] exact match in snippet view article find links to article

exists. However, the same problem is NP-complete when the input may be a mixed graph. It is #P-complete to count the number of strong orientations of a given