Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (Q830935)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some algorithmic results for finding compatible spanning circuits in edge-colored graphs |
scientific article |
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
