Back to search
A cubic algorithm for the directed Eulerian subgraph problem
Data up to Jan 2025
Published1991
Citations5
References8
Total Citations Per Year
Abstract
References (8)
Computers and Intractability: A Guide to the Theory of NP-Completeness
1979 • 45,565 citations
Topology of series-parallel networks
1965 • 532 citations
A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
1952 • 390 citations
The np-completeness of the hamiltonian cycle problem in planar diagraphs with degree bound two
1979 • 116 citations
Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
1986 • 42 citations
On multiple steiner subgraph problems
1986 • 42 citations
On finding spanning eulerian subgraphs
1985 • 16 citations
Combinatorial optimization on series-parallel graphs: algorithms and complexity
1985 • 12 citations
Cited By (0)
Loading...