{"id":"https://openalex.org/W3007553927","doi":"https://doi.org/10.1007/s10288-020-00431-4","title":"Tackling the maximum happy vertices problem in large networks","display_name":"Tackling the maximum happy vertices problem in large networks","publication_year":2020,"publication_date":"2020-02-19","ids":{"openalex":"https://openalex.org/W3007553927","doi":"https://doi.org/10.1007/s10288-020-00431-4","mag":"3007553927"},"language":"en","primary_location":{"id":"doi:10.1007/s10288-020-00431-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10288-020-00431-4","pdf_url":null,"source":{"id":"https://openalex.org/S4210191715","display_name":"4OR","issn_l":"1614-2411","issn":["1614-2411","1619-4500"],"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":"4OR","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/journal_contribution/Tackling_the_maximum_happy_vertices_problem_in_large_networks/20713573","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046309576","display_name":"Dhananjay Thiruvady","orcid":"https://orcid.org/0000-0002-8011-933X"},"institutions":[{"id":"https://openalex.org/I149704539","display_name":"Deakin University","ror":"https://ror.org/02czsnj07","country_code":"AU","type":"education","lineage":["https://openalex.org/I149704539"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Dhananjay Thiruvady","raw_affiliation_strings":["School of Information Technology, Deakin University, Geelong, VIC, Australia"],"affiliations":[{"raw_affiliation_string":"School of Information Technology, Deakin University, Geelong, VIC, Australia","institution_ids":["https://openalex.org/I149704539"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087572284","display_name":"Rhyd Lewis","orcid":"https://orcid.org/0000-0003-1046-811X"},"institutions":[{"id":"https://openalex.org/I79510175","display_name":"Cardiff University","ror":"https://ror.org/03kk7td41","country_code":"GB","type":"education","lineage":["https://openalex.org/I79510175"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Rhyd Lewis","raw_affiliation_strings":["School of Mathematics, Cardiff University, Cardiff, Wales"],"affiliations":[{"raw_affiliation_string":"School of Mathematics, Cardiff University, Cardiff, Wales","institution_ids":["https://openalex.org/I79510175"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025441020","display_name":"Kerri Morgan","orcid":"https://orcid.org/0000-0002-7263-8340"},"institutions":[{"id":"https://openalex.org/I149704539","display_name":"Deakin University","ror":"https://ror.org/02czsnj07","country_code":"AU","type":"education","lineage":["https://openalex.org/I149704539"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Kerri Morgan","raw_affiliation_strings":["School of Information Technology, Deakin University, Geelong, VIC, Australia"],"affiliations":[{"raw_affiliation_string":"School of Information Technology, Deakin University, Geelong, VIC, Australia","institution_ids":["https://openalex.org/I149704539"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5046309576"],"corresponding_institution_ids":["https://openalex.org/I149704539"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.7428,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.74278433,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"18","issue":"4","first_page":"507","last_page":"527"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9872000217437744,"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/vertex","display_name":"Vertex (graph theory)","score":0.6229345202445984},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5721971392631531},{"id":"https://openalex.org/keywords/wheel-graph","display_name":"Wheel graph","score":0.5468905568122864},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5458576679229736},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.5004448890686035},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4996457099914551},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.49721840023994446},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.48840969800949097},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.4506228566169739},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.44133415818214417},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33522501587867737},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3060271739959717},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.26505911350250244}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6229345202445984},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5721971392631531},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.5468905568122864},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5458576679229736},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.5004448890686035},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4996457099914551},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.49721840023994446},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.48840969800949097},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.4506228566169739},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.44133415818214417},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33522501587867737},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3060271739959717},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.26505911350250244},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","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},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s10288-020-00431-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10288-020-00431-4","pdf_url":null,"source":{"id":"https://openalex.org/S4210191715","display_name":"4OR","issn_l":"1614-2411","issn":["1614-2411","1619-4500"],"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":"4OR","raw_type":"journal-article"},{"id":"pmh:oai:https://orca.cardiff.ac.uk:129862","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401195","display_name":"ORCA Online Research @Cardiff (Cardiff University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79510175","host_organization_name":"Cardiff University","host_organization_lineage":["https://openalex.org/I79510175"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"pmh:oai:RePEc:spr:aqjoor:v:18:y:2020:i:4:d:10.1007_s10288-020-00431-4","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10288-020-00431-4","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:figshare.com:article/20713573","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Tackling_the_maximum_happy_vertices_problem_in_large_networks/20713573","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:http://orca-dev.cardiff.ac.uk:129862","is_oa":false,"landing_page_url":"https://orca.cardiff.ac.uk/id/eprint/129862/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401195","display_name":"ORCA Online Research @Cardiff (Cardiff University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79510175","host_organization_name":"Cardiff University","host_organization_lineage":["https://openalex.org/I79510175"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/20713573","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Tackling_the_maximum_happy_vertices_problem_in_large_networks/20713573","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1164874588","https://openalex.org/W1767486396","https://openalex.org/W1913738529","https://openalex.org/W1985603248","https://openalex.org/W2004617458","https://openalex.org/W2011653811","https://openalex.org/W2024143101","https://openalex.org/W2028379670","https://openalex.org/W2039568841","https://openalex.org/W2041132551","https://openalex.org/W2072909099","https://openalex.org/W2181005956","https://openalex.org/W2339500526","https://openalex.org/W2345094087","https://openalex.org/W2479531384","https://openalex.org/W2531766656","https://openalex.org/W2612166593","https://openalex.org/W2767544505","https://openalex.org/W2900685636","https://openalex.org/W4212899374","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2064737922","https://openalex.org/W142613662","https://openalex.org/W1999569519","https://openalex.org/W1578001576","https://openalex.org/W4294959530","https://openalex.org/W2725748332","https://openalex.org/W4312122303","https://openalex.org/W1785360057","https://openalex.org/W3080664625","https://openalex.org/W2463313349"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}