Packing non-returning \(A\)-paths algorithmically (Q2476288): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An algorithm for packing non-zero \(A\)-paths in group-labelled graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packing non-zero \(A\)-paths in group-labelled graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Paths, Trees, and Flowers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5508779 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matroid matching and some applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Über die Maximalzahl kreuzungsfreier H-Wege / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packing non-returning A-paths / rank | |||
Normal rank |
Latest revision as of 19:45, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Packing non-returning \(A\)-paths algorithmically |
scientific article |
Statements
Packing non-returning \(A\)-paths algorithmically (English)
0 references
18 March 2008
0 references
disjoint paths
0 references
matching
0 references