{"id":"https://openalex.org/W231253947","doi":"https://doi.org/10.1017/s0963548306007620","title":"On Graph Complexity","display_name":"On Graph Complexity","publication_year":2006,"publication_date":"2006-08-16","ids":{"openalex":"https://openalex.org/W231253947","doi":"https://doi.org/10.1017/s0963548306007620","mag":"231253947"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548306007620","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548306007620","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","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/A5048543827","display_name":"Stasys Jukna","orcid":"https://orcid.org/0000-0002-2786-9326"},"institutions":[{"id":"https://openalex.org/I74750888","display_name":"Lithuanian Academy of Sciences","ror":"https://ror.org/035gfy236","country_code":"LT","type":"other","lineage":["https://openalex.org/I74750888"]}],"countries":["LT"],"is_corresponding":true,"raw_author_name":"S. JUKNA","raw_affiliation_strings":["Institute of Mathematics and Informatics, Akademijos 4, LT-08663 Vilnius, Lithuania","Institute of Mathematics and Informatics, Akademijos 4, LT-08663 Vilnius, Lithuania#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics and Informatics, Akademijos 4, LT-08663 Vilnius, Lithuania","institution_ids":["https://openalex.org/I74750888"]},{"raw_affiliation_string":"Institute of Mathematics and Informatics, Akademijos 4, LT-08663 Vilnius, Lithuania#TAB#","institution_ids":["https://openalex.org/I74750888"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5048543827"],"corresponding_institution_ids":["https://openalex.org/I74750888"],"apc_list":null,"apc_paid":null,"fwci":0.6655,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67571583,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"6","first_page":"855","last_page":"876"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9994999766349792,"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.9994999766349792,"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.9983999729156494,"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/mathematical-proof","display_name":"Mathematical proof","score":0.5778827667236328},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.531538724899292},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5021977424621582},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.49374350905418396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4773400127887726},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4695841670036316},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44821634888648987},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.4386154115200043},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43299081921577454},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.41937971115112305},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3647066354751587},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18544045090675354}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5778827667236328},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.531538724899292},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5021977424621582},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.49374350905418396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4773400127887726},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4695841670036316},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44821634888648987},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.4386154115200043},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43299081921577454},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.41937971115112305},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3647066354751587},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18544045090675354},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1017/s0963548306007620","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548306007620","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.304.8594","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.8594","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lovelace.thi.informatik.uni-frankfurt.de/~jukna/ftp/graph.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.634.6390","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.634.6390","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/report/2004/005/revision/1/download/","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.65.4867","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.4867","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lovelace.thi.informatik.uni-frankfurt.de/~jukna/ftp/graph.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.71.8137","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.8137","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lovelace.thi.informatik.uni-frankfurt.de/~jukna/ftp/graph.pdf","raw_type":"text"},{"id":"mag:231253947","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W109608303","https://openalex.org/W1481710404","https://openalex.org/W1494958865","https://openalex.org/W1623354552","https://openalex.org/W1920638964","https://openalex.org/W1979337672","https://openalex.org/W1992906573","https://openalex.org/W1995365759","https://openalex.org/W2003995429","https://openalex.org/W2005223599","https://openalex.org/W2025279645","https://openalex.org/W2039809882","https://openalex.org/W2045924252","https://openalex.org/W2051576617","https://openalex.org/W2056930168","https://openalex.org/W2060270693","https://openalex.org/W2070678975","https://openalex.org/W2094783265","https://openalex.org/W2108073694","https://openalex.org/W2115569665","https://openalex.org/W2116794057","https://openalex.org/W2120551550","https://openalex.org/W2129731249","https://openalex.org/W2175296692","https://openalex.org/W2321467776","https://openalex.org/W2914893704"],"related_works":["https://openalex.org/W2084471831","https://openalex.org/W2794875535","https://openalex.org/W2028402722","https://openalex.org/W1619546176","https://openalex.org/W117968063","https://openalex.org/W2013370453","https://openalex.org/W2795065148","https://openalex.org/W2497890598","https://openalex.org/W1608540139","https://openalex.org/W2090339428","https://openalex.org/W3102635027","https://openalex.org/W3036315659","https://openalex.org/W3080569475","https://openalex.org/W1482466102","https://openalex.org/W3085534486","https://openalex.org/W570339359","https://openalex.org/W2106353099","https://openalex.org/W192770227","https://openalex.org/W2797680869","https://openalex.org/W3178412543"],"abstract_inverted_index":{"By":[0],"the":[1,8,19,35,46,72],"complexity":[2,37,47],"of":[3,11,22,30,38,48,66],"a":[4],"graph":[5],"we":[6],"mean":[7],"minimum":[9],"number":[10],"union":[12],"and":[13],"intersection":[14],"operations":[15],"needed":[16],"to":[17,34],"obtain":[18],"whole":[20],"set":[21],"its":[23],"edges":[24],"starting":[25],"from":[26],"stars.":[27],"This":[28,52],"measure":[29],"graphs":[31],"is":[32],"related":[33],"circuit":[36],"boolean":[39,59],"functions.We":[40],"prove":[41],"some":[42,54,67],"lower":[43,56,69],"bounds":[44,57,70],"on":[45],"explicitly":[49],"given":[50],"graphs.":[51],"yields":[53],"new":[55,64],"for":[58],"functions,":[60],"as":[61,63],"well":[62],"proofs":[65],"known":[68],"in":[71,87],"graph-theoretic":[73],"framework.":[74],"We":[75],"also":[76],"formulate":[77],"several":[78],"combinatorial":[79],"problems":[80],"whose":[81],"solution":[82],"would":[83],"have":[84],"intriguing":[85],"consequences":[86],"computational":[88],"complexity.":[89]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}