Computing paths of large rank in planar frameworks deterministically (Q6668350)
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: Computing paths of large rank in planar frameworks deterministically |
scientific article; zbMATH DE number 7972300
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing paths of large rank in planar frameworks deterministically |
scientific article; zbMATH DE number 7972300 |
Statements
Computing paths of large rank in planar frameworks deterministically (English)
0 references
22 January 2025
0 references
planar graph
0 references
longest path
0 references
linear matroid
0 references
irrelevant vertex
0 references
0 references
0 references
