Efficient reassembling of graphs. I: The linear case (Q2359807)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient reassembling of graphs. I: The linear case |
scientific article |
Statements
Efficient reassembling of graphs. I: The linear case (English)
0 references
22 June 2017
0 references
minimum cutwidth
0 references
optimal linear arrangement
0 references
linear graph reassembling
0 references
polynomial reducibility
0 references
NP-hardness
0 references
0 references