{"id":"https://openalex.org/W7128808073","doi":"https://doi.org/10.1007/978-981-95-7127-7_25","title":"Forcing a\u00a0Unique Minimum Spanning Tree and\u00a0a\u00a0Unique Shortest Path","display_name":"Forcing a\u00a0Unique Minimum Spanning Tree and\u00a0a\u00a0Unique Shortest Path","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7128808073","doi":"https://doi.org/10.1007/978-981-95-7127-7_25"},"language":"en","primary_location":{"id":"doi:10.1007/978-981-95-7127-7_25","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-981-95-7127-7_25","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003386955","display_name":"Tatsuya Gima","orcid":"https://orcid.org/0000-0003-2815-5699"},"institutions":[{"id":"https://openalex.org/I205349734","display_name":"Hokkaido University","ror":"https://ror.org/02e16g702","country_code":"JP","type":"education","lineage":["https://openalex.org/I205349734"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Tatsuya Gima","raw_affiliation_strings":["Hokkaido University, Hokkaido, Japan"],"raw_orcid":"https://orcid.org/0000-0003-2815-5699","affiliations":[{"raw_affiliation_string":"Hokkaido University, Hokkaido, Japan","institution_ids":["https://openalex.org/I205349734"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125897777","display_name":"Yasuaki Kobayashi","orcid":null},"institutions":[{"id":"https://openalex.org/I205349734","display_name":"Hokkaido University","ror":"https://ror.org/02e16g702","country_code":"JP","type":"education","lineage":["https://openalex.org/I205349734"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yasuaki Kobayashi","raw_affiliation_strings":["Hokkaido University, Hokkaido, Japan"],"raw_orcid":"https://orcid.org/0000-0003-3244-6915","affiliations":[{"raw_affiliation_string":"Hokkaido University, Hokkaido, Japan","institution_ids":["https://openalex.org/I205349734"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033878501","display_name":"Yota Otachi","orcid":"https://orcid.org/0000-0002-0087-853X"},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yota Otachi","raw_affiliation_strings":["Nagoya University, Nagoya, Japan"],"raw_orcid":"https://orcid.org/0000-0002-0087-853X","affiliations":[{"raw_affiliation_string":"Nagoya University, Nagoya, Japan","institution_ids":["https://openalex.org/I60134161"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5125967765","display_name":"Takumi Sato","orcid":null},"institutions":[{"id":"https://openalex.org/I205349734","display_name":"Hokkaido University","ror":"https://ror.org/02e16g702","country_code":"JP","type":"education","lineage":["https://openalex.org/I205349734"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takumi Sato","raw_affiliation_strings":["Hokkaido University, Hokkaido, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hokkaido University, Hokkaido, Japan","institution_ids":["https://openalex.org/I205349734"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5003386955"],"corresponding_institution_ids":["https://openalex.org/I205349734"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.5256705,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"371","last_page":"385"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5214999914169312,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5214999914169312,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.24310000240802765,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.08250000327825546,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/forcing","display_name":"Forcing (mathematics)","score":0.7336999773979187},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6654000282287598},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6646000146865845},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5565000176429749},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5378000140190125},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.527899980545044},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42570000886917114},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41749998927116394}],"concepts":[{"id":"https://openalex.org/C197115733","wikidata":"https://www.wikidata.org/wiki/Q1003136","display_name":"Forcing (mathematics)","level":2,"score":0.7336999773979187},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6654000282287598},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6646000146865845},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5565000176429749},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5378000140190125},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5375999808311462},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5306000113487244},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.527899980545044},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42570000886917114},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41749998927116394},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.37229999899864197},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3700999915599823},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3325999975204468},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3294000029563904},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29809999465942383},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.29499998688697815},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.28839999437332153},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.2863999903202057},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28540000319480896},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.28060001134872437},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.2799000144004822},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.27399998903274536},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2599000036716461},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-981-95-7127-7_25","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-981-95-7127-7_25","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7158595323562622}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1965680834","https://openalex.org/W1969477020","https://openalex.org/W1975073433","https://openalex.org/W1999789113","https://openalex.org/W2005851739","https://openalex.org/W2013967419","https://openalex.org/W2022817231","https://openalex.org/W2053934832","https://openalex.org/W2059372025","https://openalex.org/W2064796716","https://openalex.org/W2118947995","https://openalex.org/W2118966355","https://openalex.org/W2155190380","https://openalex.org/W2287814470","https://openalex.org/W4231868828","https://openalex.org/W4242943559","https://openalex.org/W4393160648","https://openalex.org/W4409362631","https://openalex.org/W4411986173","https://openalex.org/W7083164184"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2026-02-14T00:00:00"}