Using contracted solution graphs for solving reconfiguration problems. (Q4608579): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| label / en | label / en | ||
Using contracted solution graphs for solving reconfiguration problems. | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPIcs.MFCS.2016.20 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963007653 / rank | |||
Normal rank | |||
| Property / title | |||
Using contracted solution graphs for solving reconfiguration problems. (English) | |||
| Property / title: Using contracted solution graphs for solving reconfiguration problems. (English) / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPICS.MFCS.2016.20 / rank | |||
Normal rank | |||
Latest revision as of 15:48, 30 December 2024
scientific article; zbMATH DE number 6851853
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using contracted solution graphs for solving reconfiguration problems. |
scientific article; zbMATH DE number 6851853 |
Statements
21 March 2018
0 references
reconfiguration
0 references
contraction
0 references
dynamic programming
0 references
graph coloring
0 references
Using contracted solution graphs for solving reconfiguration problems. (English)
0 references
