Divide-and-conquer algorithms for graph-layout problems (Q5689819)
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: Divide-and-conquer algorithms for graph-layout problems |
scientific article; zbMATH DE number 961973
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Divide-and-conquer algorithms for graph-layout problems |
scientific article; zbMATH DE number 961973 |
Statements
7 January 1997
0 references
decomposition
0 references
graph-layout problems
0 references
bandwidth
0 references
cutwidth
0 references
pagenumber
0 references
linear-time algorithms
0 references
series-parallel graphs
0 references
divide-and-conquer
0 references
Divide-and-conquer algorithms for graph-layout problems (English)
0 references
