Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (Q830935): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Zhi-Wei Guo / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Hajo J. Broersma / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Sheng Gui Zhang / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-020-00644-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3083134246 / rank | |||
Normal rank | |||
Latest revision as of 00:17, 20 March 2024
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
