A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges (Q2032181): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2021.106146 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W3169464877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast scaling algorithm for the weighted triangle-free 2-matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-Free 2-Matchings Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted b-Matchings in Degree-Bounded Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matching problem with side conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect triangle-free 2-matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding maximum square-free 2-matchings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Cardinality Simple 2-matchings in Subcubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedron of triangle-free simple 2-matchings in subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Maximum Cost $K_{t,t}$‐Free <i>t</i>‐Matchings of Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algorithms for matchings, even factors and square-free 2-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted restricted 2-matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Weighted <i>k<sub>t, t</sub></i>-Free <i>t</i>-Factor Algorithm for Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded \(t\)-factors in bipartite graphs: a unified framework for nonbipartite matchings and restricted 2-matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2021.106146 / rank
 
Normal rank

Latest revision as of 20:07, 16 December 2024

scientific article
Language Label Description Also known as
English
A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges
scientific article

    Statements

    A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges (English)
    0 references
    0 references
    0 references
    16 June 2021
    0 references
    restricted 2-matching
    0 references
    triangle-free 2-matching
    0 references
    maximum weight \(b\)-matching
    0 references
    graph algorithms
    0 references
    half-edges
    0 references

    Identifiers