Gallai-Edmonds decomposition as a pruning technique (Q301487): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SCIL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LEDA / 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/s10100-013-0309-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980981969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for a special case of disjoint set union / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introducing global constraints in CHIP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dulmage-Mendelsohn canonical decomposition as a generic pruning technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting search with variable elimination in constraint optimization and constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5508779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global constraints for round robin tournament scheduling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching structure and the matching lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4702188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for computing simple \(k\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for a Minimum Cover of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of the Factor Theorem for Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:51, 12 July 2024

scientific article
Language Label Description Also known as
English
Gallai-Edmonds decomposition as a pruning technique
scientific article

    Statements

    Gallai-Edmonds decomposition as a pruning technique (English)
    0 references
    0 references
    30 June 2016
    0 references
    constraint programming
    0 references
    global constraints
    0 references
    filtering algorithms
    0 references
    matching theory
    0 references
    decomposition theory
    0 references
    extreme sets
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references