{"id":"https://openalex.org/W2589102023","doi":"https://doi.org/10.1007/978-3-319-53925-6_18","title":"Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs","display_name":"Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2589102023","doi":"https://doi.org/10.1007/978-3-319-53925-6_18","mag":"2589102023"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-53925-6_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-53925-6_18","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":"conference-paper","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/A5003248242","display_name":"Hiroshi Eto","orcid":"https://orcid.org/0000-0003-1456-1987"},"institutions":[{"id":"https://openalex.org/I135598925","display_name":"Kyushu University","ror":"https://ror.org/00p4k0j84","country_code":"JP","type":"education","lineage":["https://openalex.org/I135598925"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hiroshi Eto","raw_affiliation_strings":["Kyushu University, Fukuoka, 812-8581, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kyushu University, Fukuoka, 812-8581, Japan","institution_ids":["https://openalex.org/I135598925"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003089989","display_name":"Takehiro Ito","orcid":"https://orcid.org/0000-0002-9912-6898"},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]},{"id":"https://openalex.org/I4210086780","display_name":"Japan Science and Technology Agency","ror":"https://ror.org/00097mb19","country_code":"JP","type":"government","lineage":["https://openalex.org/I1319490839","https://openalex.org/I4210086780"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takehiro Ito","raw_affiliation_strings":["CREST, JST, 4-1-8 Honcho, Kawaguchi, Saitama, 332-0012, Japan","Tohoku University, Sendai, 980-8579, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CREST, JST, 4-1-8 Honcho, Kawaguchi, Saitama, 332-0012, Japan","institution_ids":["https://openalex.org/I4210086780"]},{"raw_affiliation_string":"Tohoku University, Sendai, 980-8579, Japan","institution_ids":["https://openalex.org/I201537933"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075163299","display_name":"Zhi Long Liu","orcid":"https://orcid.org/0000-0001-8988-6546"},"institutions":[{"id":"https://openalex.org/I207014233","display_name":"Kyushu Institute of Technology","ror":"https://ror.org/02278tr80","country_code":"JP","type":"education","lineage":["https://openalex.org/I207014233"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Zhilong Liu","raw_affiliation_strings":["Kyushu Institute of Technology, Fukuoka, 820-8502, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kyushu Institute of Technology, Fukuoka, 820-8502, Japan","institution_ids":["https://openalex.org/I207014233"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057410359","display_name":"Eiji Miyano","orcid":"https://orcid.org/0000-0002-4260-7818"},"institutions":[{"id":"https://openalex.org/I207014233","display_name":"Kyushu Institute of Technology","ror":"https://ror.org/02278tr80","country_code":"JP","type":"education","lineage":["https://openalex.org/I207014233"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Eiji Miyano","raw_affiliation_strings":["Kyushu Institute of Technology, Fukuoka, 820-8502, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kyushu Institute of Technology, Fukuoka, 820-8502, Japan","institution_ids":["https://openalex.org/I207014233"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"228","last_page":"240"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.996999979019165,"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.8003283143043518},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7602008581161499},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5809985399246216},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.57578045129776},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5607908368110657},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5380133986473083},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47690725326538086},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.472319096326828},{"id":"https://openalex.org/keywords/cubic-graph","display_name":"Cubic graph","score":0.4420112371444702},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4116283655166626},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3921020030975342},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.324765145778656},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.2499902844429016},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17138084769248962},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12620267271995544},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.06827890872955322}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8003283143043518},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7602008581161499},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5809985399246216},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.57578045129776},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5607908368110657},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5380133986473083},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47690725326538086},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.472319096326828},{"id":"https://openalex.org/C100500283","wikidata":"https://www.wikidata.org/wiki/Q1374495","display_name":"Cubic graph","level":5,"score":0.4420112371444702},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4116283655166626},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3921020030975342},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.324765145778656},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2499902844429016},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17138084769248962},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12620267271995544},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.06827890872955322},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-53925-6_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-53925-6_18","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":[{"id":"https://openalex.org/G1397929271","display_name":"Efficient algorithm design based on graph structural properties for graph optimization problems","funder_award_id":"26330017","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G6540202353","display_name":"Algorithms and their generalizations for vehicle routing problems of minimizing regrets","funder_award_id":"16K00004","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W20372564","https://openalex.org/W42852446","https://openalex.org/W1963707128","https://openalex.org/W1969719208","https://openalex.org/W1973310391","https://openalex.org/W1980842804","https://openalex.org/W1989539462","https://openalex.org/W2048237851","https://openalex.org/W2071807296","https://openalex.org/W2100432797","https://openalex.org/W2541167211","https://openalex.org/W2610183793","https://openalex.org/W2799004609","https://openalex.org/W4213214460"],"related_works":["https://openalex.org/W2103112216","https://openalex.org/W4283803822","https://openalex.org/W2029336174","https://openalex.org/W1963654174","https://openalex.org/W2804969619","https://openalex.org/W2057124519","https://openalex.org/W1968027460","https://openalex.org/W1492613353","https://openalex.org/W1608132493","https://openalex.org/W1811247372"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}