scientific article; zbMATH DE number 3551893
From MaRDI portal
Publication:4125770
Cited in
(6)- Bi-criteria and approximation algorithms for restricted matchings
- Maximum weight edge-constrained matchings
- The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness
- Color-constrained arborescences in edge-colored digraphs
- Arborescences and shortest path trees when colors matter
- On the succinct representation of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4125770)
