Constructing Eulerian Trails in a Graph

In graph theory, an Eulerian trail (or Eulerian path) is a trail in a finite graph that visits every edge exactly once (allowing for revisiting vertices). Similarly, an Eulerian circuit or Eulerian cycle is an Eulerian trail that starts and ends on the same vertex.

Parameters

$V$ : number of vertices
$E$ : number of edges

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 3 of 3 algorithms


Fleury's algorithm + Thorup	2000	$O(E \log^3(E) \log\log E)$	$O(E)$
Fleury's algorithm + Tarjan	1974	$O(E^2)$	$O(E)$
Hierholzer's algorithm	1873	$O(E)$	$O(E)$

Reductions Table

Insuffient Data to display table

Other relevant algorithms