Odd paths, cycles, and \(T\)-joins: connections and algorithms (Q7020159)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7991544
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Odd paths, cycles, and \(T\)-joins: connections and algorithms |
scientific article; zbMATH DE number 7991544 |
Statements
Odd paths, cycles, and \(T\)-joins: connections and algorithms (English)
0 references
4 March 2025
0 references
shortest odd path
0 references
shortest odd cycle
0 references
minimum-weight odd \(T\)-join
0 references
conservative graph
0 references
parity constraint
0 references
computational complexity
0 references
