Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-016-0164-5 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-016-0164-5 / rank | |||
Normal rank | |||
Revision as of 03:34, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm |
scientific article |
Statements
Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (English)
0 references
11 May 2017
0 references
rank-width
0 references
linear rank-width
0 references
distance-hereditary graphs
0 references
vertex-minors
0 references
matroid branch-width
0 references
matroid path-width
0 references
0 references
0 references
