グラフ理論
□記事を途中から表示しています
[最初から表示]
^ Diestel, p. 20
^ グラフ理論の歴史を扱っているBiggs et al. (1998)にオイラーの論文の英訳を含む節がある。
^ 詳しくは、一筆書きの項を参照。
^ ⇒無向グラフと有向グラフ
^ a b c d ディーステル 2000, 1.1 グラフ
^ Bondy & Murty 2008, p. 50.
^ ディーステル 2000, p. 10.
^ ⇒多重グラフ
^ ベルジュ「グラフの理論I」p.8.
^ ディーステル, 2000
^ 茨木「アルゴリズムとデータ構造」
^ ディーステル 2000, p. 6.
^ Bondy & Murty 2008, p. 80.
^ ⇒閉路
^ Diestel, p. 115
^ Hale, Scott A. (2013). “Multilinguals and Wikipedia Editing”. Proceedings of the 2014 ACM Conference on Web Science - WebSci '14: 99?108. arXiv:1312.0976. doi:10.1145/2615569.2615684. .mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation.cs-ja1 q,.mw-parser-output .citation.cs-ja2 q{quotes:"「""」""『""』"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free a,.mw-parser-output .citation .cs1-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/6/65/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited a,.mw-parser-output .id-lock-registration a,.mw-parser-output .citation .cs1-lock-limited a,.mw-parser-output .citation .cs1-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/d/d6/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription a,.mw-parser-output .citation .cs1-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/a/aa/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("//upload.wikimedia.org/wikipedia/commons/4/4c/Wikisource-logo.svg")right 0.1em center/12px no-repeat}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:#d33}.mw-parser-output .cs1-visible-error{color:#d33}.mw-parser-output .cs1-maint{display:none;color:#3a3;margin-left:0.3em}.mw-parser-output .cs1-format{font-size:95%}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}ISBN 9781450326223.
^ Mashaghi, A. (2004). “Investigation of a protein complex network”. European Physical Journal B 41 (1): 113?121. arXiv:cond-mat/0304207. Bibcode: 2004EPJB...41..113M. doi:10.1140/epjb/e2004-00301-0.
^ a b Shah, Preya; Ashourvan, Arian; Mikhail, Fadi; Pines, Adam; Kini, Lohith; Oechsel, Kelly; Das, Sandhitsu R; Stein, Joel M et al. (2019-07-01). “Characterizing the role of the structural connectome in seizure dynamics” (英語). Brain 142 (7): 1955?1972. doi:10.1093/brain/awz125. ISSN 0006-8950. https://academic.oup.com/brain/article/142/7/1955/5491072.
^ Grandjean, Martin (2016). “A social network analysis of Twitter: Mapping the digital humanities community”. Cogent Arts & Humanities 3 (1): 1171458. doi:10.1080/23311983.2016.1171458.
^ Vecchio, F (2017). “"Small World" architecture in brain connectivity and hippocampal volume in Alzheimer's disease: a study via graph theory from EEG data”. Brain Imaging and Behavior 11 (2): 473?485. doi:10.1007/s11682-016-9528-3. PMID 26960946.
^ Vecchio, F (2013). “Brain network connectivity assessed using graph theory in frontotemporal dementia”. Neurology 81 (2): 134?143. doi:10.1212/WNL.0b013e31829a33f8.
^ “ ⇒TextGraphs: Graph-based Algorithms for Natural Language Processing”. 2019年7月26日閲覧。
^ Bjorken, J. D.; Drell, S. D. (1965). Relativistic Quantum Fields. New York: McGraw-Hill. p. viii
^ Kumar, Ankush; Kulkarni, G. U. (2016-01-04). “Evaluating conducting network based transparent electrodes from geometrical considerations”. Journal of Applied Physics 119 (1): 015102. Bibcode: 2016JAP...119a5102K. doi:10.1063/1.4939280. ISSN 0021-8979.
^ Grandjean, Martin (2015). ⇒"Social network analysis and visualization: Moreno’s Sociograms revisited". Redesigned network strictly based on Moreno (1934), Who Shall Survive.
次ページ記事の検索おまかせリスト▼オプションを表示暇つぶしWikipedia
Size:74 KB
出典: フリー百科事典『ウィキペディア（Wikipedia）』
担当:undef