Chinese postman problem
Johnson's algorithm
Canadian traveller problem
Suurballe's algorithm
closeness
Borůvka's algorithm
breadth
connected graph
Menger's theorem
path length
Eppstein's algorithm
reachability
tournament
king
Floyd-Warshall algorithm
Dijkstra's algorithm
slopegraph
Bellman-Ford algorithm
pathwidth
A*
complete graph
superconcentrator
Kosaraju's algorithm
isthmus
abline
small-world network
tree
polynema
Tarjan's algorithm
undirected path
directed path
Hamiltonian path
point-to-point
pseudo-edge
valency
biconnected
boxicity
bidirected
reachable
cyclomatic
assortativity
collider
Herschel graph
Steiner tree
pseudoforest
directed edge
disassortative
cutwidth
crossing number
dominate
ultrasparsifier
bridge
subgraph
pathfinding
girth
connectivity
sparsifier
supervertex
edgotype
decycling
outdegree
local minimum
cocktail party graph
line graph
edge
turning point
utility graph
outbranch
size
Euler line
strongly connected
directed acyclic graph
hypergraph
line
graph antihole
anarboricity
dual graph
Veblen's theorem
altermatic
end
Desargues graph
snake-in-the-box problem
empty graph
plumbago
snark
nonblocker
clique number
depth-first search
medial graph
directed graph
graphette
strongly connected component
arboricity
multitree
edge covering number
polygraph
flow network
vertex
pseudograph

English words for 'The problem of finding the shortest closed path or circuit that visits every edge of a (connected) undirected graph.'

As you may have noticed, above you will find words for "The problem of finding the shortest closed path or circuit that visits every edge of a (connected) undirected graph.". Hover the mouse over the word you'd like to know more about to view its definition. Click search related words by phrase or description. to find a better fitting word. Finally, thanks to ChatGPT, the overall results have been greatly improved.

Recent Queries