A special case for subset interconnection designs
From MaRDI portal
Publication:1377654
DOI10.1016/S0166-218X(97)00023-1zbMath0893.90162MaRDI QIDQ1377654
Ding-Zhu Du, Biao Gao, Weili Wu
Publication date: 26 January 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Related Items
The longest common subsequence problem for arc-annotated sequences, New dominating sets in social networks
Cites Work
- The complexity of facets (and some facets of complexity)
- On complexity of subset interconnection designs
- On the Desirability of Acyclic Database Schemes
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Matroids and Subset Interconnection Design
- Two algorithms for the subset interconnection design problem
