{"id":"https://openalex.org/W1980170589","doi":"https://doi.org/10.1002/net.3230110404","title":"A polynomial time algorithm for finding the absolute center of a network","display_name":"A polynomial time algorithm for finding the absolute center of a network","publication_year":1981,"publication_date":"1981-12-01","ids":{"openalex":"https://openalex.org/W1980170589","doi":"https://doi.org/10.1002/net.3230110404","mag":"1980170589"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230110404","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230110404","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5062351025","display_name":"Edward Minieka","orcid":null},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Edward Minieka","raw_affiliation_strings":["Quantitative Methods Department, University of Illinois, Box 4348, Chicago, Illinois 60680"],"affiliations":[{"raw_affiliation_string":"Quantitative Methods Department, University of Illinois, Box 4348, Chicago, Illinois 60680","institution_ids":["https://openalex.org/I39422238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062351025"],"corresponding_institution_ids":["https://openalex.org/I39422238"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.3221,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.81452606,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":95},"biblio":{"volume":"11","issue":"4","first_page":"351","last_page":"355"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.988099992275238,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9843000173568726,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.7107126116752625},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.588698148727417},{"id":"https://openalex.org/keywords/center","display_name":"Center (category theory)","score":0.5782921314239502},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5329291224479675},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.531075656414032},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5224189758300781},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4919597804546356},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.45220351219177246},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4238501787185669},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3569313883781433},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3406175374984741},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18565967679023743},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09382155537605286}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7107126116752625},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.588698148727417},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.5782921314239502},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5329291224479675},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.531075656414032},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5224189758300781},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4919597804546356},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.45220351219177246},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4238501787185669},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3569313883781433},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3406175374984741},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18565967679023743},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09382155537605286},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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.1002/net.3230110404","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230110404","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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":5,"referenced_works":["https://openalex.org/W2078667951","https://openalex.org/W2102750402","https://openalex.org/W4255296422","https://openalex.org/W4298308013","https://openalex.org/W4302399279"],"related_works":["https://openalex.org/W3118505512","https://openalex.org/W2349797546","https://openalex.org/W191849398","https://openalex.org/W2359578922","https://openalex.org/W2996337372","https://openalex.org/W2052899165","https://openalex.org/W2376911392","https://openalex.org/W2388654557","https://openalex.org/W2198982833","https://openalex.org/W2767202586"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"absolute":[2,42],"center":[3],"of":[4,54,62],"a":[5,35],"network":[6],"is":[7,27,46],"any":[8],"vertex":[9,23],"or":[10],"point":[11],"on":[12],"an":[13,41],"edge":[14],"such":[15],"that":[16],"the":[17,22,55],"distance":[18],"from":[19,25],"it":[20,26],"to":[21],"farthest":[24],"as":[28,30],"small":[29],"possible.":[31],"This":[32,44],"paper":[33],"presents":[34],"polynomial":[36],"time":[37],"algorithm":[38,45],"for":[39],"finding":[40],"center.":[43],"combinatorial":[47],"in":[48],"nature":[49],"and":[50],"requires":[51],"only":[52],"knowledge":[53],"shortest":[56],"path":[57],"distances":[58],"between":[59],"all":[60],"pairs":[61],"vertices.":[63]},"counts_by_year":[{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}