Approximating Maximum Uniquely Restricted Matchings in Bipartite Graphs

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2019.04.024
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Finding Maximum Degrees in Hidden Bipartite Graphs

2010English

Approximating Chromatic Sum Coloring of Bipartite Graphs in Expected Polynomial Time

Proceedings of the Institute for System Programming of RAS
2015English

Matchings in Geometric Graphs

English

Domination in Bipartite Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Colourings in Bipartite Graphs

International Journal of Computer Applications
2011English

Extending Matchings in Graphs: A Survey

1990English

Induced Matchings in Subcubic Planar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Large Rainbow Matchings in Edge-Coloured Graphs

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2012English

Terminal-Pairability in Complete Bipartite Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy