On complexity of subset interconnection designs
- 1 March 1995
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 6 (2) , 193-205
- https://doi.org/10.1007/bf01096768
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- On the complexity of an optimal routing tree problemActa Mathematicae Applicatae Sinica, English Series, 1989
- Matroids and Subset Interconnection DesignSIAM Journal on Discrete Mathematics, 1988
- An optimization problem on graphsDiscrete Applied Mathematics, 1986
- An O(v|v| c |E|) algoithm for finding maximum matching in general graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980