A cubic algorithm for the directed Eulerian subgraph problem
From MaRDI portal
Publication:806684
DOI10.1016/0377-2217(91)90266-XzbMath0729.90086MaRDI QIDQ806684
R. Gary Parker, Michael B. Richey
Publication date: 1991
Published in: European Journal of Operational Research (Search for Journal in Brave)
directed graph; cubic algorithm; NP- hard; directed Eulerian subgraph problem; directed series-parallel graphs
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
- Topology of series-parallel networks
- On finding spanning eulerian subgraphs
- Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
- On multiple steiner subgraph problems
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs