On finding spanning eulerian subgraphs (Q3703676)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3928748
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On finding spanning eulerian subgraphs |
scientific article; zbMATH DE number 3928748 |
Statements
On finding spanning eulerian subgraphs (English)
0 references
1985
0 references
(connected) spanning Eulerian subgraph
0 references
undirected graph
0 references
NP- completeness
0 references
polynomial-time algorithms
0 references
series-parallel graphs
0 references
heuristic notions
0 references
0.8262256979942322
0 references
0.8093007206916809
0 references
0.8036817908287048
0 references
