A fast algorithm for the path 2-packing problem (Q2268342): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 360 / rank
 
Normal rank
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.1007/s00224-008-9141-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077595059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Path 2-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free multiflows in bidirected and skew-symmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem / 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: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3828033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some connectivity properties of Eulerian graphs / 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 kantendisjunkter A-Wege / 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: A short proof of Mader's \(\mathcal S\)-paths theorem / 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: Q4782696 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:08, 2 July 2024

scientific article
Language Label Description Also known as
English
A fast algorithm for the path 2-packing problem
scientific article

    Statements

    A fast algorithm for the path 2-packing problem (English)
    0 references
    0 references
    5 March 2010
    0 references
    path packing
    0 references
    \(T\)-paths
    0 references
    polynomial-time algorithm
    0 references

    Identifiers