Packing non-zero \(A\)-paths via matroid matching (Q317424): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2016.06.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2467002039 / 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: Q4819371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Matroid Property Algorithms / 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: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die Maximalzahl kreuzungsfreier H-Wege / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5390304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing non-returning A-paths / 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: Matroids of gain graphs in applied discrete geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biased graphs. II: The three matroids / rank
 
Normal rank

Latest revision as of 15:06, 12 July 2024

scientific article
Language Label Description Also known as
English
Packing non-zero \(A\)-paths via matroid matching
scientific article

    Statements

    Packing non-zero \(A\)-paths via matroid matching (English)
    0 references
    0 references
    0 references
    30 September 2016
    0 references
    disjoint paths
    0 references
    \(A\)-path
    0 references
    group-labeled graph
    0 references
    matroid matching
    0 references
    frame matroid
    0 references

    Identifiers