The labeled perfect matching in bipartite graphs (Q1044711): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for MAX SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many or few colors in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4659605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search for the minimum label spanning tree problem with bounded color classes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloured matchings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum labeling spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicolored matchings in some classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Matching Problems for Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum label spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation algorithms for the minimum satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the minimum label spanning tree. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in colored bipartite networks / rank
 
Normal rank

Revision as of 07:17, 2 July 2024

scientific article
Language Label Description Also known as
English
The labeled perfect matching in bipartite graphs
scientific article

    Statements

    The labeled perfect matching in bipartite graphs (English)
    0 references
    18 December 2009
    0 references
    labeled matching
    0 references
    bipartite graphs
    0 references
    NP-complete
    0 references
    approximate algorithms
    0 references
    0 references

    Identifiers