Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q59889091, #quickstatements; #temporary_batch_1707337057885 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59889091 / rank | |||
Normal rank | |||
Revision as of 21:39, 7 February 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
