Bounding the number of odd paths in planar graphs via convex optimization (Q6606323)
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: Bounding the number of odd paths in planar graphs via convex optimization |
scientific article; zbMATH DE number 7914201
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounding the number of odd paths in planar graphs via convex optimization |
scientific article; zbMATH DE number 7914201 |
Statements
Bounding the number of odd paths in planar graphs via convex optimization (English)
0 references
16 September 2024
0 references
graph theory
0 references
optimization theory
0 references
planar graphs
0 references
0.8130512833595276
0 references
0.7642256021499634
0 references
0.7457783222198486
0 references
