A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (Q494803): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68R10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6477674 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
fixed parameter algorithm | |||
| Property / zbMATH Keywords: fixed parameter algorithm / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
graph drawing | |||
| Property / zbMATH Keywords: graph drawing / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
subexponential time | |||
| Property / zbMATH Keywords: subexponential time / rank | |||
Normal rank | |||
Revision as of 23:43, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization |
scientific article |
Statements
A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (English)
0 references
2 September 2015
0 references
fixed parameter algorithm
0 references
graph drawing
0 references
subexponential time
0 references
