|
|||||
|
|
An algorithm for finding a minimal equivalent graph of a strongly connected digraph |
|
| Authors: | Dr. S. Martello |
| Affiliation: | 1. Istituto di Automatica, University of Bologna, Viale Risorgimento, 2, I-40136, Bologna, Italy |
| Abstract: | |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |