{"id":"https://openalex.org/W7155039099","doi":"https://doi.org/10.48550/arxiv.2604.16327","title":"An improved upper bound measure of star complexity of graphs","display_name":"An improved upper bound measure of star complexity of graphs","publication_year":2026,"publication_date":"2026-03-09","ids":{"openalex":"https://openalex.org/W7155039099","doi":"https://doi.org/10.48550/arxiv.2604.16327"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.16327","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.16327","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.16327","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112061572","display_name":"Russell K. Standish","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Standish, Russell K.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5112061572"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7020000219345093,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7020000219345093,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.10610000044107437,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.09809999912977219,"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/star","display_name":"Star (game theory)","score":0.7972000241279602},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6182000041007996},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.5126000046730042},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.49889999628067017},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.45010000467300415},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43639999628067017},{"id":"https://openalex.org/keywords/star-network","display_name":"Star network","score":0.41359999775886536},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3946000039577484}],"concepts":[{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.7972000241279602},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6182000041007996},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.607699990272522},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5296000242233276},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5126000046730042},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.49889999628067017},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4674000144004822},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.45010000467300415},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43959999084472656},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43639999628067017},{"id":"https://openalex.org/C71976206","wikidata":"https://www.wikidata.org/wiki/Q841749","display_name":"Star network","level":4,"score":0.41359999775886536},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4002000093460083},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3946000039577484},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.37869998812675476},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3677999973297119},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.3456999957561493},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.32820001244544983},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.31189998984336853},{"id":"https://openalex.org/C2780148112","wikidata":"https://www.wikidata.org/wiki/Q1432581","display_name":"Proxy (statistics)","level":2,"score":0.2888999879360199},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.2702000141143799},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26460000872612},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.259799987077713},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.25459998846054077},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2531000077724457}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.16327","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.16327","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.16327","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.16327","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,45,65],"\\cite{Standish25c},":[1],"I":[2,22,48,70,73,105],"explored":[3],"the":[4,15,43,56,67,77,87,97,108],"connection":[5,98],"between":[6,42,99,139],"star":[7,20,33,83,100,140],"complexity":[8,101,115,141,145],"and":[9,35,102,142],"information":[10,143],"based":[11,144],"complexity.":[12,119],"Because":[13],"of":[14,82,129],"numerical":[16],"difficulty":[17],"in":[18],"computing":[19,76],"complexity,":[21,34,84,104],"introduced":[23],"a":[24,37,50,127,135],"proxy":[25],"measure":[26],"that":[27,72],"is":[28,146],"an":[29],"upper":[30,52],"bound":[31],"to":[32,61,112,126],"showed":[36],"strong":[38],"albeit":[39],"non-linear":[40],"relationship":[41,138],"measures.":[44],"this":[46,121],"paper,":[47],"introduce":[49],"tighter":[51,88],"bound,":[53],"by":[54],"exploiting":[55],"well-known":[57],"ABC":[58],"package":[59],"used":[60],"optimise":[62],"logic":[63],"circuits.":[64],"testing":[66],"new":[68,122],"measure,":[69,124],"found":[71],"had":[74],"been":[75],"{\\em":[78,89],"formula":[79,118],"complexity}":[80,91],"variant":[81],"rather":[85,116],"than":[86,117],"circuit":[90,103,114],"variant.":[92],"Since":[93],"Jukna":[94],"clearly":[95],"states":[96],"have":[106],"modified":[107],"graph":[109],"walking":[110],"algorithm":[111],"capture":[113],"With":[120],"ABC-based":[123],"applied":[125],"set":[128],"1000":[130],"500":[131],"vertex":[132],"Erd\u00f6s-Renyi":[133],"graphs,":[134],"more":[136],"linear":[137],"found.":[147]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-22T00:00:00"}