| Title: | ALGORITHM FOR FINDING ALL MAXIMAL COMPLETE SUBGRAPHS AND AN ESTIMATE OF THE ORDER OF COMPUTATIONAL COMPLEXITY |
| Authors: | DAS, SR SHENG, CL CHEN, Z 交大名義發表 資訊工程學系 National Chiao Tung University Department of Computer Science |
| Issue Date: | 1978 |
| URI: | http://hdl.handle.net/11536/5108 |
| ISSN: | 0045-7906 |
| Journal: | COMPUTERS & ELECTRICAL ENGINEERING |
| Volume: | 5 |
| Issue: | 4 |
| Begin Page: | 365 |
| End Page: | 368 |
| Appears in Collections: | Articles |
- A heuristic approach to generating file spanning trees for reliability analysis of distributed computing systems / Chen, DJ;Chen, RS;Huang, TH
- ALGORITHMIC ASPECTS OF NEIGHBORHOOD NUMBERS / CHANG, GJ;FARBER, M;TUZA, Z
- A factoring approach for the Steiner tree problem in undirected networks / Wang, Chu-Fu;Jan, Rong-Hong
- Extended Instruction Exploration for Multiple-Issue Architectures / Wu, I-Wei;Shann, Jean Jyh-Jiun;Hsu, Wei-Chung;Chung, Chung-Ping
- RELIABILITY-ANALYSIS OF DISTRIBUTED SYSTEMS BASED ON A FAST RELIABILITY ALGORITHM / CHEN, DJ;HUANG, TH
- MAGNITUDE ORDERING OF DEGREE COMPLEMENTS OF CERTAIN NODE PAIRS IN AN UNDIRECTED GRAPH AND AN ALGORITHM TO FIND A CLASS OF MAXIMAL SUBGRAPHS / DAS, SR;SHENG, CL;CHEN, Z;LIN, T
Loading...