Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity (Q2797090): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algebraic Algorithms for Linear Matroid Parity Problems / rank
 
Normal rank
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: An augmenting path algorithm for linear matroid parity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of tensors and fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid matching and some applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3934404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die Maximalzahl kreuzungsfreier H-Wege / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast, Simpler Algorithm for the Matroid Parity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5306146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing non-returning A-paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing non-returning \(A\)-paths algorithmically / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing non-zero \(A\)-paths via matroid matching / rank
 
Normal rank

Latest revision as of 17:54, 11 July 2024

scientific article
Language Label Description Also known as
English
Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity
scientific article

    Statements

    Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity (English)
    0 references
    0 references
    0 references
    4 April 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    \(A\)-path
    0 references
    disjoint paths
    0 references
    group-labelled graph
    0 references
    linear matroid parity
    0 references
    0 references