Linear arrangement problems on recursively partitioned graphs (Q3778551): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The NP-completeness of the bandwidth minimization problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Minimum Linear Arrangement Algorithm for Undirected Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polynomial algorithm for the min-cut linear arrangement of trees / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:09, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear arrangement problems on recursively partitioned graphs |
scientific article |
Statements
Linear arrangement problems on recursively partitioned graphs (English)
0 references
1988
0 references
restrictions of linear arrangement problems
0 references
binary tree
0 references
p-tree
0 references
circuit layout systems
0 references
polynomial time
0 references
NP-complete
0 references
0 references
