Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (Q830935)
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: Some algorithmic results for finding compatible spanning circuits in edge-colored graphs |
scientific article; zbMATH DE number 7346748
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some algorithmic results for finding compatible spanning circuits in edge-colored graphs |
scientific article; zbMATH DE number 7346748 |
Statements
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (English)
0 references
10 May 2021
0 references
edge-colored graph
0 references
compatible spanning circuit
0 references
NP-complete problem
0 references
polynomial-time algorithm
0 references
0.9151531457901
0 references
0.8854919075965881
0 references
0.8644063472747803
0 references
0.8290407657623291
0 references
