Matchings under distance constraints. I
From MaRDI portal
Publication:2241576
Recommendations
Cites work
- A strongly polynomial minimum cost circulation algorithm
- Approximating maximum uniquely restricted matchings in bipartite graphs
- Connections in combinatorial optimization
- Fundamentals of parameterized complexity
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- List-coloring of interval graphs with application to register assignment for heterogeneous register-set architectures
- Models and solution techniques for frequency assignment problems
- On Maximum Cost $K_{t,t}$‐Free t‐Matchings of Bipartite Graphs
- On some hard and some tractable cases of the maximum acyclic matching problem
- Reducibility among combinatorial problems
- Restricted b-matchings in degree-bounded graphs
- Some Matching Problems for Bipartite Graphs
- The distance matching problem
This page was built for publication: Matchings under distance constraints. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2241576)