generating random unlabeled(n,m)-graphs
碩士 === 國立中山大學 === 應用數學研究所 === 77 ===
Main Authors: | CAI, FU-JIAN, 蔡福建 |
---|---|
Other Authors: | LI, MENG-FENG |
Format: | Others |
Language: | zh-TW |
Published: |
1989
|
Online Access: | http://ndltd.ncl.edu.tw/handle/52317276848159956612 |
Similar Items
-
On the size of two families of unlabeled bipartite graphs
by: Abdullah Atmaca, et al.
Published: (2019-08-01) -
On the size of two families of unlabeled bipartite graphs
by: Abdullah Atmaca, et al.
Published: (2019-08-01) -
An Efficient Algorithm for Mining Frequent Unlabeled Graphs
by: Lee, Ming, et al.
Published: (2010) -
R-Local Unlabeled Sensing: A Novel Graph Matching Approach for Multiview Unlabeled Sensing Under Local Permutations
by: Ahmed Abbasi, et al.
Published: (2021-01-01) -
Establish the expected number of induced motifs on unlabeled graphs through analytical models
by: Emanuele Martorana, et al.
Published: (2020-09-01)