On the np-completeness of certain network testing problems
- 1 March 1984
- Vol. 14 (1), 1-24
- https://doi.org/10.1002/net.3230140102
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- NP-completeness of some generalizations of the maximum matching problemInformation Processing Letters, 1982
- Algorithms for Edge Coloring Bipartite Graphs and MultigraphsSIAM Journal on Computing, 1982
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973