Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees (Q3740255)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees |
scientific article |
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
