A cubic algorithm for the directed Eulerian subgraph problem (Q806684)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A cubic algorithm for the directed Eulerian subgraph problem |
scientific article; zbMATH DE number 4207244
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cubic algorithm for the directed Eulerian subgraph problem |
scientific article; zbMATH DE number 4207244 |
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
0.88399595
0 references
0.87411356
0 references
0.8734637
0 references
0 references
0 references
0.8636838
0 references
0.8627839
0 references
0.85986316
0 references
0.85860014
0 references
