Some Matching Problems for Bipartite Graphs
From MaRDI portal
Cited in
(45)- The labeled perfect matching in bipartite graphs
- The complexity of matching with bonds
- Degree switching operations in networks and large scale systems assignment problems
- An NP-complete matching problem
- Coloured matchings in bipartite graphs
- Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
- Parameterized algorithms and kernels for rainbow matching
- Budgeted colored matching problems
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
- Path colorings in bipartite graphs
- Selecting and covering colored points
- Algorithms and complexity for a class of combinatorial optimization problems with labelling
- From one to many rainbow Hamiltonian cycles
- Matching-based capture strategies for 3D heterogeneous multiplayer reach-avoid differential games
- Decomposition of university course timetabling. A systematic study of subproblems and their complexities
- Matchings under distance constraints. I
- Assignment problem with conflicts
- Graph matching problems and the NP-hardness of sortedness constraints
- Integrality gaps for colorful matchings
- Bi-criteria and approximation algorithms for restricted matchings
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
- Maximum weight edge-constrained matchings
- On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems
- Neighborhood portfolio approach for local search applied to timetabling problems
- Complexity results for rainbow matchings
- Embedding of complete graphs in broken Chimera graphs
- Traveling salesman problems in temporal graphs
- An introduction to temporal graphs: an algorithmic perspective
- The Complexity of Bottleneck Labeled Graph Problems
- Self-organized anonymous authentication in mobile ad hoc networks
- A note on the hardness results for the labeled perfect matching problems in bipartite graphs
- Minimum-diameter covering problems
- A weighted perfect matching with constraints on weights of its parts
- Parameterized Algorithms and Kernels for Rainbow Matching
- An introduction to temporal graphs: an algorithmic perspective
- Minimum <scp>color‐degree</scp> perfect b‐matchings
- Matchings under distance constraints. II.
- Color-constrained arborescences in edge-colored digraphs
- Quantifying and reducing the complexity of multi-line charts as a visual aid in multi-criteria decision-making
- Stability in graphs with matroid constraints
- Arborescences and shortest path trees when colors matter
- Three results towards approximation of special maximum matchings in graphs
- A heuristic algorithm for rainbow matchings and its application in rainbow Ramsey number for matchings
- A theory of rectangular dual graphs
- On complexity of special maximum matchings constructing
This page was built for publication: Some Matching Problems for Bipartite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4170253)
