{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1361981471212410240.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.2307/2033241"}},{"identifier":{"@type":"NAID","@value":"30018327678"}}],"dc:title":[{"@value":"On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem"}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1381981471212410240","@type":"Researcher","foaf:name":[{"@value":"Joseph B. Kruskal"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"00029939"}],"prism:publicationName":[{"@value":"Proceedings of the American Mathematical Society"}],"dc:publisher":[{"@value":"JSTOR"}],"prism:publicationDate":"1956-02","prism:volume":"7","prism:number":"1","prism:startingPage":"48"},"reviewed":"false","createdAt":"2006-04-22","modifiedAt":"2018-05-08","relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1050001337862106240","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"A Synthesis of a Forest-Type Optimal File Transfer on a File Transmission Net with Source Vertices"}]},{"@id":"https://cir.nii.ac.jp/crid/1050282812859385216","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"リンク・ステート型経路制御におけるトポロジ・ブロードキャスト制御"},{"@language":"en","@value":"A Topology Broadcast Control on Link State Routing"},{"@language":"ja-Kana","@value":"リンク ステートガタ ケイロ セイギョ ニ オケル トポロジ ブロードキャスト セイギョ"}]},{"@id":"https://cir.nii.ac.jp/crid/1360021389805194624","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Minimum-Spanning-Tree-Based Time Delay Estimation Robust to Outliers"}]},{"@id":"https://cir.nii.ac.jp/crid/1360567185347910400","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"SPF-CellTracker: Tracking Multiple Cells with Strongly-Correlated Moves Using a Spatial Particle Filter"}]},{"@id":"https://cir.nii.ac.jp/crid/1361134273563763328","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"DNA Taxonomy Confirms the Identity of the Widely-Disjunct Mediterranean and Atlantic Populations of the Tufted Ghost Crab Ocypode cursor (Crustacea: Decapoda: Ocypodidae)"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001204109459328","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"CHANCE CONSTRAINED BOTTLENECK SPANNING TREE PROBLEM WITH FUZZY RANDOM EDGE COSTS"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001204338745600","@type":"Article","relationType":["isReferencedBy","isCitedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"可能性および必然性に基づくファジィ極大木問題"},{"@language":"en","@value":"A Fuzzy Spanning Tree Problem Based on Possibility and Necessity"},{"@language":"ja-Kana","@value":"カノウセイ オヨビ ヒツゼンセイ ニ モトヅク ファジィ キョクダイ ボク モンダイ"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001204340155520","@type":"Article","relationType":["isReferencedBy","isCitedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"行列ベース遺伝的アルゴリズムによる区間係数を伴う2目的最小木問題の一解法"},{"@language":"en","@value":"Matrix-based Genetic Algorithm Approach on Bicriteria Minimum Spanning Tree Problem with Interval Coefficients"},{"@language":"ja-Kana","@value":"ギョウレツ ベース イデンテキ アルゴリズム ニ ヨル クカン ケイスウ オ トモナウ 2 モクテキ サイショウ モク モンダイ ノ イチカイホウ"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001204374972160","@type":"Article","relationType":["isReferencedBy","isCitedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Scalable Backup Configurations Creation for IP Fast Reroute"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001204376517376","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Performance of Thorup's Shortest Path Algorithm for Large-Scale Network Simulation"}]},{"@id":"https://cir.nii.ac.jp/crid/1390009062457966592","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Automatic Grouping of Redundant Sensors and Actuators Using Functional and Spatial"},{"@language":"ja","@value":"機能的・空間的接続を利用した冗長なセンサ・アクチュエータの自動分割:"},{"@value":"Automatic Grouping of Redundant Sensors and Actuators Using Functional and Spatial Connections: Application to Muscle Grouping for Musculoskeletal Humanoids"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282679354457472","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"An Optimal Parallel Algorithm for Constructing a Spanning Tree on Circular Permutation Graphs"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282679451447552","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"A Network-Based Spatial Analytical Method for Detecting Agglomerations in a Point Distribution on a Network and Its Implementation"},{"@value":"ネットワーク上の点分布から多層的集塊性を抽出する空間分析手法の提案,及びその実装に関する研究"},{"@language":"ja-Kana","@value":"ネットワーク ジョウ ノ テン ブンプ カラ タソウテキシュウカイセイ オ チュウシュツ スル クウカン ブンセキ シュホウ ノ テイアン オヨビ ソノ ジッソウ ニ カンスル ケンキュウ"}]},{"@id":"https://cir.nii.ac.jp/crid/1390570796245706368","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Minimal Spanning Tree Analysis of Fungal Spore Spatial Patterns"}]},{"@id":"https://cir.nii.ac.jp/crid/1520290883167800064","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"センサネットワークにおける無線送信電力の制御方式の提案"},{"@language":"ja-Kana","@value":"センサ ネットワーク ニ オケル ムセン ソウシン デンリョク ノ セイギョ ホウシキ ノ テイアン"}]},{"@id":"https://cir.nii.ac.jp/crid/1520290885183561216","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"ファジィ関係に関する諸問題--計算法を中心に"},{"@language":"ja-Kana","@value":"ファジィ カンケイ ニ カンスル ショ モンダイ ケイサンホウ オ チュウシン"}]},{"@id":"https://cir.nii.ac.jp/crid/1520572358819039744","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@value":"A Modefied Method of Adaptive Space-filling Coding"},{"@language":"ja-Kana","@value":"Modefied Method of Adaptive Space filling Coding"}]},{"@id":"https://cir.nii.ac.jp/crid/1572261549591760640","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"A NEW ALGORITHM : FOR LOWER BOUNDS OF ALL-TERMINAL RELIABILITY"}]},{"@id":"https://cir.nii.ac.jp/crid/1573105975037784960","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"ファジィ係数を伴う最小木問題の一解法"},{"@language":"en","@value":"Minimum Spanning Tree Problem with Fuzzy Coefficients"}]},{"@id":"https://cir.nii.ac.jp/crid/1573105977194524416","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Sparse Spanning Subgraphs Preserving Connectivity and Distance between Vertices and Vertex Subsets"}]},{"@id":"https://cir.nii.ac.jp/crid/1573668925042970496","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"A Possibilistic and Stochastic Programming Approach to Fuzzy Random MST Problems(Neural Networks and Fuzzy Systems, <Special Section>Recent Advances in Circuits and Systems)"}]},{"@id":"https://cir.nii.ac.jp/crid/1574231877311589376","@type":"Article","relationType":["isCitedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"A New Evolutionary Approach for the Optimal Communication Spanning Tree Problem"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.2307/2033241"},{"@type":"CIA","@value":"30018327678"},{"@type":"CROSSREF","@value":"10.1109/tcbb.2017.2782255_references_DOI_TpRigXGXFa3wRf1XBFX6iIeDRDv"},{"@type":"CROSSREF","@value":"10.1109/access.2023.3327011_references_DOI_TpRigXGXFa3wRf1XBFX6iIeDRDv"},{"@type":"CROSSREF","@value":"10.1587/transinf.e92.d.141_references_DOI_TpRigXGXFa3wRf1XBFX6iIeDRDv"},{"@type":"CROSSREF","@value":"10.1587/transcom.e95.b.1592_references_DOI_TpRigXGXFa3wRf1XBFX6iIeDRDv"},{"@type":"CROSSREF","@value":"10.15807/jorsj.43.128_references_DOI_TpRigXGXFa3wRf1XBFX6iIeDRDv"},{"@type":"CROSSREF","@value":"10.1109/lra.2021.3060715_references_DOI_TpRigXGXFa3wRf1XBFX6iIeDRDv"},{"@type":"CROSSREF","@value":"10.1587/transcom.e94.b.109_references_DOI_TpRigXGXFa3wRf1XBFX6iIeDRDv"},{"@type":"CROSSREF","@value":"10.3156/jfuzzy.12.6_79_references_DOI_TpRigXGXFa3wRf1XBFX6iIeDRDv"},{"@type":"CROSSREF","@value":"10.3156/jfuzzy.10.6_1144_references_DOI_TpRigXGXFa3wRf1XBFX6iIeDRDv"},{"@type":"CROSSREF","@value":"10.2108/zs180191_references_DOI_TpRigXGXFa3wRf1XBFX6iIeDRDv"}]}