Algorithm to Generate All Connected Simple Graphs of Given Order

• Item type: SIG Technical Reports(1)
• 公開日: 2013-02-22
• タイトル: Algorithm to Generate All Connected Simple Graphs of Given Order
• タイトル / 言語: en
• タイトル: Algorithm to Generate All Connected Simple Graphs of Given Order
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_18gh
• 資源タイプ: technical report
• 著者所属: Principles of Informatics Research Division, National Institute of Informatics
• 著者所属: Principles of Informatics Research Division, National Institute of Informatics
• 著者所属(英): en
• 著者所属(英): Principles of Informatics Research Division, National Institute of Informatics
• 著者所属(英): en
• 著者所属(英): Principles of Informatics Research Division, National Institute of Informatics
• 著者名: Tetsushi, Matsui; Takeaki, Uno
• 著者名(英): Tetsushi, Matsui; Takeaki, Uno
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: We present an efficient algorithm to generate connected simple graphs of given order. It is based on the reverse search technique and a new vertex partitioning strategy. By implementing the algorithm in C, we can generate all connected simple graphs of order 11 in five and a half hours.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: We present an efficient algorithm to generate connected simple graphs of given order. It is based on the reverse search technique and a new vertex partitioning strategy. By implementing the algorithm in C, we can generate all connected simple graphs of order 11 in five and a half hours.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN1009593X
• 書誌情報: 研究報告アルゴリズム（AL）; 巻 2013-AL-143, 号 15, p. 1-5, 発行日 2013-02-22
• Notice: SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
• 出版者 / 言語: ja
• 出版者: 情報処理学会