{"id":"https://openalex.org/W2069230977","doi":"https://doi.org/10.1007/bf02579450","title":"Maximum andk-th maximal spanning trees of a weighted graph","display_name":"Maximum andk-th maximal spanning trees of a weighted graph","publication_year":1987,"publication_date":"1987-06-01","ids":{"openalex":"https://openalex.org/W2069230977","doi":"https://doi.org/10.1007/bf02579450","mag":"2069230977"},"language":"en","primary_location":{"id":"doi:10.1007/bf02579450","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02579450","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","raw_type":"journal-article"},"type":"article","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/A5062422841","display_name":"Mikio Kan\u014d","orcid":"https://orcid.org/0000-0002-7545-0327"},"institutions":[{"id":"https://openalex.org/I4210117807","display_name":"National Institute of Technology, Akashi College","ror":"https://ror.org/029kvcs29","country_code":"JP","type":"education","lineage":["https://openalex.org/I4210117807","https://openalex.org/I4210120810"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"M. Kano","raw_affiliation_strings":["Department of Mathematics, Akashi Technological College, 674, Uozumi, Akashi, Japan","Akashi Technological College, Akashi, Japan#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Akashi Technological College, 674, Uozumi, Akashi, Japan","institution_ids":["https://openalex.org/I4210117807"]},{"raw_affiliation_string":"Akashi Technological College, Akashi, Japan#TAB#","institution_ids":["https://openalex.org/I4210117807"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062422841"],"corresponding_institution_ids":["https://openalex.org/I4210117807"],"apc_list":null,"apc_paid":null,"fwci":1.0651,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.76469614,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"7","issue":"2","first_page":"205","last_page":"214"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"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/T11476","display_name":"Graph theory and applications","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9765999913215637,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8914964199066162},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8846926093101501},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8671244382858276},{"id":"https://openalex.org/keywords/bijection","display_name":"Bijection","score":0.7621148824691772},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5921268463134766},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5874060392379761},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5392282605171204},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4954162836074829},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.45980966091156006},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.45576533675193787},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4194222092628479},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37620630860328674}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8914964199066162},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8846926093101501},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8671244382858276},{"id":"https://openalex.org/C24424167","wikidata":"https://www.wikidata.org/wiki/Q180907","display_name":"Bijection","level":2,"score":0.7621148824691772},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5921268463134766},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5874060392379761},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5392282605171204},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4954162836074829},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.45980966091156006},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.45576533675193787},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4194222092628479},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37620630860328674}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf02579450","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02579450","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W75076678","https://openalex.org/W1519532587","https://openalex.org/W1964119857","https://openalex.org/W1965680834","https://openalex.org/W2017927472","https://openalex.org/W2041447998","https://openalex.org/W2057084070","https://openalex.org/W2063292248","https://openalex.org/W2113242830"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W4380840098","https://openalex.org/W2014991506","https://openalex.org/W2387385213","https://openalex.org/W2307044859","https://openalex.org/W2099915933","https://openalex.org/W2589768050","https://openalex.org/W3016811403","https://openalex.org/W88291963","https://openalex.org/W2138987445"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}