Solving Matching Problems Efficiently in Bipartite Graphs (Q2946048): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on an edge coloring problem of Folkman and Fulkerson / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-coloring bipartite multigraphs in \(O(E \log D)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings with few colors: counting, enumeration and combinatorial bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering the edges with consecutive sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5604409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Elimination and Chordal Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Difference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple existence criterion for \((g<f)\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The disjoint paths problem in quadratic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved edge-coloring with three colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutte's edge-colouring conjecture / 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: A constructive characterization of trees with at least k disjoint maximum matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank

Latest revision as of 19:15, 10 July 2024

scientific article
Language Label Description Also known as
English
Solving Matching Problems Efficiently in Bipartite Graphs
scientific article

    Statements

    Solving Matching Problems Efficiently in Bipartite Graphs (English)
    0 references
    0 references
    15 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references