A cubic algorithm for the directed Eulerian subgraph problem (Q806684): Difference between revisions
From MaRDI portal
Latest revision as of 17:57, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A cubic algorithm for the directed Eulerian subgraph problem |
scientific article |
Statements
A cubic algorithm for the directed Eulerian subgraph problem (English)
0 references
1991
0 references
The authors discuss the problem to find for a given directed graph G(V,A) with arc weighted function w a maximum (arc)-weight subgraph of G which is Eulerian. The problem is NP-hard. The authors give a cubic-time algorithm for its resolution on directed series-parallel graphs.
0 references
cubic algorithm
0 references
directed Eulerian subgraph problem
0 references
directed graph
0 references
NP- hard
0 references
directed series-parallel graphs
0 references
0 references
