{"id":"https://openalex.org/W1530661797","doi":"https://doi.org/10.1007/978-3-540-24587-2_8","title":"Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees","display_name":"Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1530661797","doi":"https://doi.org/10.1007/978-3-540-24587-2_8","mag":"1530661797"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-24587-2_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-24587-2_8","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/A5001958215","display_name":"Atsuko Yamaguchi","orcid":"https://orcid.org/0000-0001-7538-5337"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]},{"id":"https://openalex.org/I4399598384","display_name":"Kyoto University Institute for Chemical Research","ror":"https://ror.org/0349bbg69","country_code":null,"type":"facility","lineage":["https://openalex.org/I22299242","https://openalex.org/I4399598384"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Atsuko Yamaguchi","raw_affiliation_strings":["Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, 611-0011, Japan"],"affiliations":[{"raw_affiliation_string":"Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, 611-0011, Japan","institution_ids":["https://openalex.org/I22299242","https://openalex.org/I4399598384"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059001924","display_name":"Hiroshi Mamitsuka","orcid":"https://orcid.org/0000-0002-6607-5617"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]},{"id":"https://openalex.org/I4399598384","display_name":"Kyoto University Institute for Chemical Research","ror":"https://ror.org/0349bbg69","country_code":null,"type":"facility","lineage":["https://openalex.org/I22299242","https://openalex.org/I4399598384"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hiroshi Mamitsuka","raw_affiliation_strings":["Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, 611-0011, Japan"],"affiliations":[{"raw_affiliation_string":"Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, 611-0011, Japan","institution_ids":["https://openalex.org/I22299242","https://openalex.org/I4399598384"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001958215"],"corresponding_institution_ids":["https://openalex.org/I22299242","https://openalex.org/I4399598384"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.711,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69863014,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"58","last_page":"67"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7541161775588989},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7053250074386597},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6744015216827393},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5864763259887695},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.582665205001831},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.565127432346344},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.564639151096344},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5592716932296753},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5240164995193481},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.523981511592865},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.4985952377319336},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47841697931289673},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4692644476890564},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.4678628742694855},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4608357548713684},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4567100405693054},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.45495525002479553},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.43592262268066406},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.34148794412612915},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.18347498774528503},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.17508140206336975},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.13440746068954468},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.1296166479587555},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.05659213662147522}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7541161775588989},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7053250074386597},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6744015216827393},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5864763259887695},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.582665205001831},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.565127432346344},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.564639151096344},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5592716932296753},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5240164995193481},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.523981511592865},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.4985952377319336},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47841697931289673},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4692644476890564},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.4678628742694855},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4608357548713684},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4567100405693054},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.45495525002479553},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.43592262268066406},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.34148794412612915},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.18347498774528503},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17508140206336975},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.13440746068954468},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.1296166479587555},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.05659213662147522},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-24587-2_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-24587-2_8","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1514401476","https://openalex.org/W1605991832","https://openalex.org/W1972324328","https://openalex.org/W1991755800","https://openalex.org/W2011039300","https://openalex.org/W2059372025","https://openalex.org/W2067514766","https://openalex.org/W2069653535","https://openalex.org/W2076043677","https://openalex.org/W2085550081","https://openalex.org/W2113221321","https://openalex.org/W2132750992","https://openalex.org/W2479632476","https://openalex.org/W2561675875"],"related_works":["https://openalex.org/W2058332489","https://openalex.org/W1997570556","https://openalex.org/W2074417667","https://openalex.org/W2408068853","https://openalex.org/W2095481180","https://openalex.org/W1514905840","https://openalex.org/W2943635264","https://openalex.org/W4239736023","https://openalex.org/W1985209733","https://openalex.org/W1530661797"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}