Maximal Singly Connected Digraphs
碩士 === 國立臺北商業大學 === 資訊與決策科學研究所 === 104 === A directed graph G is singly connected if each pair of vertices is connected by at most one simple path, and maximal singly connected if no other singly connected directed graph with the same set of vertices contains the edges of G. In this thesis, we explo...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/ubd3vq |