The power of linear-time data reduction for maximum matching (Q2211355): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(10 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-020-00736-0 / rank
Normal rank
 
Property / author
 
Property / author: Rolf Niedermeier / rank
Normal rank
 
Property / author
 
Property / author: Rolf Niedermeier / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Stony Brook / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3104783836 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1609.08879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3418606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of vertex colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching and multidimensional matching in chordal and strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Approximation for Maximum Weight Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth / 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: Faster scaling algorithms for general graph matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Tree-Depth for Fully Polynomial FPT Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Adaptive Parameterized Algorithms on Modular Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for maximum matchings in convex, bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching in regular and almost regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-020-00736-0 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:16, 17 December 2024

scientific article
Language Label Description Also known as
English
The power of linear-time data reduction for maximum matching
scientific article

    Statements

    The power of linear-time data reduction for maximum matching (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 November 2020
    0 references
    maximum-cardinality matching
    0 references
    bipartite graphs
    0 references
    linear-time algorithms
    0 references
    kernelization
    0 references
    parameterized complexity analysis
    0 references
    FPT in P
    0 references
    0 references
    0 references

    Identifiers

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