Dynamic Monopoly in Simple Directed Graphs with Girth g
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 99 === Suppose G(V,E) is a simple directed graph, where there is at most one directed edge between each pair of vertices. We say G(V,E) has girth g if the length of the shortest cycle in is . We shall require that each vertex in a simple directed graph have at least...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/79606676945973446482 |