Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees (Q3740255)
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: Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees |
scientific article; zbMATH DE number 3974317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees |
scientific article; zbMATH DE number 3974317 |
Statements
Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees (English)
0 references
1985
0 references
VLSI
0 references
Min Cut Linear Arrangement
0 references
cutwidth
0 references
folding number
0 references
integrated circuit layout
0 references
layout of Weinberger arrays
0 references
black/white pebble demand
0 references
degree three trees
0 references
search number
0 references
forbidden subgraph characterization
0 references
0.9252181
0 references
0.92509454
0 references
0.91225904
0 references
0 references
0.90268505
0 references
0.90145266
0 references
0.8978245
0 references
0.89656883
0 references
