{"id":"https://openalex.org/W1528279016","doi":"https://doi.org/10.1007/978-3-540-69733-6_42","title":"Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction","display_name":"Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction","publication_year":2008,"publication_date":"2008-08-12","ids":{"openalex":"https://openalex.org/W1528279016","doi":"https://doi.org/10.1007/978-3-540-69733-6_42","mag":"1528279016"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-69733-6_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-69733-6_42","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/A5015584067","display_name":"Masaya Mito","orcid":null},"institutions":[{"id":"https://openalex.org/I113306721","display_name":"Hiroshima University","ror":"https://ror.org/03t78wx29","country_code":"JP","type":"education","lineage":["https://openalex.org/I113306721"]},{"id":"https://openalex.org/I57930482","display_name":"Hiroshima City University","ror":"https://ror.org/001et4e78","country_code":"JP","type":"education","lineage":["https://openalex.org/I57930482"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Masaya Mito","raw_affiliation_strings":["Department of Information Engineering Graduate School of Engineering, Hiroshima University, \u00a0","Department of Information Engineering, Graduate School of Engineering, Hiroshima University,"],"affiliations":[{"raw_affiliation_string":"Department of Information Engineering Graduate School of Engineering, Hiroshima University, \u00a0","institution_ids":["https://openalex.org/I113306721","https://openalex.org/I57930482"]},{"raw_affiliation_string":"Department of Information Engineering, Graduate School of Engineering, Hiroshima University,","institution_ids":["https://openalex.org/I113306721"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087923932","display_name":"Satoshi Fujita","orcid":"https://orcid.org/0000-0001-9412-7309"},"institutions":[{"id":"https://openalex.org/I57930482","display_name":"Hiroshima City University","ror":"https://ror.org/001et4e78","country_code":"JP","type":"education","lineage":["https://openalex.org/I57930482"]},{"id":"https://openalex.org/I113306721","display_name":"Hiroshima University","ror":"https://ror.org/03t78wx29","country_code":"JP","type":"education","lineage":["https://openalex.org/I113306721"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Satoshi Fujita","raw_affiliation_strings":["Department of Information Engineering Graduate School of Engineering, Hiroshima University, \u00a0","Department of Information Engineering, Graduate School of Engineering, Hiroshima University,"],"affiliations":[{"raw_affiliation_string":"Department of Information Engineering Graduate School of Engineering, Hiroshima University, \u00a0","institution_ids":["https://openalex.org/I113306721","https://openalex.org/I57930482"]},{"raw_affiliation_string":"Department of Information Engineering, Graduate School of Engineering, Hiroshima University,","institution_ids":["https://openalex.org/I113306721"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015584067"],"corresponding_institution_ids":["https://openalex.org/I113306721","https://openalex.org/I57930482"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3861,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.59730827,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"425","last_page":"433"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9980000257492065,"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.9968000054359436,"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/computer-science","display_name":"Computer science","score":0.6037447452545166},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5880546569824219},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5485717058181763},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5320169925689697},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5282736420631409},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4852580726146698},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4821464717388153},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.47756510972976685},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4429033398628235},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4144289493560791},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.41253870725631714},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40802842378616333},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3713356554508209},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34901103377342224},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31111815571784973},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.17741456627845764},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.05510309338569641}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6037447452545166},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5880546569824219},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5485717058181763},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5320169925689697},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5282736420631409},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4852580726146698},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4821464717388153},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.47756510972976685},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4429033398628235},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4144289493560791},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.41253870725631714},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40802842378616333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3713356554508209},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34901103377342224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31111815571784973},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.17741456627845764},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.05510309338569641}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-69733-6_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-69733-6_42","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":21,"referenced_works":["https://openalex.org/W634086385","https://openalex.org/W1493071618","https://openalex.org/W1495272862","https://openalex.org/W1540132677","https://openalex.org/W1552743905","https://openalex.org/W1581552469","https://openalex.org/W1971663478","https://openalex.org/W1991307540","https://openalex.org/W2011039300","https://openalex.org/W2076901266","https://openalex.org/W2098962864","https://openalex.org/W2110116975","https://openalex.org/W2128353214","https://openalex.org/W2134003300","https://openalex.org/W2143180579","https://openalex.org/W2150124995","https://openalex.org/W2155984879","https://openalex.org/W2622381546","https://openalex.org/W4205502579","https://openalex.org/W4232665025","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W1998712144","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W2028363955","https://openalex.org/W110470963","https://openalex.org/W2407258439","https://openalex.org/W4300669526","https://openalex.org/W2143081532","https://openalex.org/W2949168773"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"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"}