Maximum and optimal 1-2 matching problem of the different kind (Q5035028): 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.1080/09720529.2020.1833439 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3119420649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors and factorizations of graphs. Proof techniques in factor theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting trail theorem for the maximum 1-2 matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum 1-2 matching problem and two kinds of its variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial parity \((g,f)\)-factors and subgraphs covering given vertex subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The factorization of graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Assignment and Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of Menger's graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual integrality in b-matching problems / 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: Good characterizations for some degree constrained subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some techniques useful for solution of transportation network problems / rank
 
Normal rank

Latest revision as of 01:42, 28 July 2024

scientific article; zbMATH DE number 7477498
Language Label Description Also known as
English
Maximum and optimal 1-2 matching problem of the different kind
scientific article; zbMATH DE number 7477498

    Statements

    Maximum and optimal 1-2 matching problem of the different kind (English)
    0 references
    0 references
    0 references
    0 references
    21 February 2022
    0 references
    maximum matching
    0 references
    optimal matching
    0 references
    augmenting trail
    0 references

    Identifiers