|
Prof Harold Thimbleby's The Chinese Postman Problem (9)
Eulerian Cycle/Chinese Postman |
Combinatorica (7)
Generating Permutations,
Generating Subsets,
Generating Partitions,
Generating Graphs,
Transitive Closure and Reduction,
Eulerian Cycle/Chinese Postman,
Edge and Vertex Connectivity,
Drawing Trees,
Planarity Detection and Embedding,
Vertex Cover,
Edge Coloring,
Graph Isomorphism,
Longest Common Substring/Subsequence |