A cubic algorithm for the directed Eulerian subgraph problem (Q806684): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Topology of series-parallel networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3924253 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On multiple steiner subgraph problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On finding spanning eulerian subgraphs / rank | |||
Normal rank |
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