{"id":"https://openalex.org/W1972647554","doi":"https://doi.org/10.1016/0304-3975(94)90157-0","title":"Lower bounds for on-line graph coloring","display_name":"Lower bounds for on-line graph coloring","publication_year":1992,"publication_date":"1992-03-10","ids":{"openalex":"https://openalex.org/W1972647554","doi":"https://doi.org/10.1016/0304-3975(94)90157-0","mag":"1972647554"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(94)90157-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)90157-0","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5019056248","display_name":"Magn\u00fas M. Halld\u00f3rsson","orcid":"https://orcid.org/0000-0002-5774-8437"},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Magn\u00fas Halld\u00f3rsson","raw_affiliation_strings":["Tokyo Inst. of Tech"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tokyo Inst. of Tech","institution_ids":["https://openalex.org/I114531698"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113860564","display_name":"M\u00e1ri\u00f3 Szegedy","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M\u00e1ri\u00f3 Szegedy","raw_affiliation_strings":["AT&T Bell Laboratories, 600 Mountain avenue, Murray Hill, NJ, 07974 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Bell Laboratories, 600 Mountain avenue, Murray Hill, NJ, 07974 USA","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":1.472,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.82467347,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"130","issue":"1","first_page":"163","last_page":"174"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9976000189781189,"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.9976000189781189,"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.7487945556640625},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6363158226013184},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5519579648971558},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5127519369125366},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4916689991950989},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.4617837071418762},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.4393317699432373},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43243107199668884},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41845160722732544},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2604941725730896},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2319205403327942},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.18782609701156616}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7487945556640625},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6363158226013184},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5519579648971558},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5127519369125366},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4916689991950989},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.4617837071418762},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.4393317699432373},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43243107199668884},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41845160722732544},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2604941725730896},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2319205403327942},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.18782609701156616}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1016/0304-3975(94)90157-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)90157-0","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"doi:10.1090/dimacs/007/15","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/007/15","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.145.1786","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.1786","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.raunvis.hi.is/~mmh/Papers/tcs94.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.398.3096","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.398.3096","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.raunvis.hi.is/~mmh/Papers/tcs94.pdf","raw_type":"text"},{"id":"mag:1972647554","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/soda/soda92.html#HalldorssonS92","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Symposium on Discrete Algorithms","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":12,"referenced_works":["https://openalex.org/W1976753172","https://openalex.org/W2004533347","https://openalex.org/W2043862089","https://openalex.org/W2084263468","https://openalex.org/W2094224753","https://openalex.org/W2148102331","https://openalex.org/W2166858292","https://openalex.org/W2170823181","https://openalex.org/W3125739345","https://openalex.org/W4231402170","https://openalex.org/W6671049055","https://openalex.org/W6993038557"],"related_works":["https://openalex.org/W2041645394","https://openalex.org/W2949355389","https://openalex.org/W2056070842","https://openalex.org/W2038445565","https://openalex.org/W2148102331","https://openalex.org/W1487760418","https://openalex.org/W1983029152","https://openalex.org/W2542676400","https://openalex.org/W3000828483","https://openalex.org/W3150189735","https://openalex.org/W2109368894","https://openalex.org/W2884281616","https://openalex.org/W2794218106","https://openalex.org/W3033362299","https://openalex.org/W2793449571","https://openalex.org/W2963475507","https://openalex.org/W2963714020","https://openalex.org/W2395400446","https://openalex.org/W2074622067","https://openalex.org/W2158133904"],"abstract_inverted_index":{"An":[0],"algorithm":[1,29,39],"for":[2,26,36,49],"vertex-coloring":[3],"graphs":[4],"is":[5,13],"said":[6],"to":[7,52,91],"be":[8],"on-line":[9,73],"if":[10],"each":[11],"vertex":[12],"irrevocably":[14],"assigned":[15],"a":[16,32,54],"color":[17],"before":[18],"later":[19],"vertices":[20,102],"are":[21],"considered.":[22],"We":[23,61],"show":[24,63],"that":[25,64],"every":[27],"such":[28],"there":[30],"exists":[31],"log":[33],"n-colorable":[34],"graph":[35],"which":[37],"the":[38,69,72,85,99,107],"uses":[40],"at":[41],"least":[42],"2n/log":[43],"n":[44,93],"colors.":[45],"This":[46],"also":[47],"holds":[48],"randomized":[50],"algorithms,":[51],"within":[53],"constant":[55],"factor,":[56],"against":[57],"an":[58],"oblivious":[59],"adversary.":[60],"then":[62],"various":[65],"means":[66],"of":[67,71,89,98],"relaxing":[68],"constraints":[70],"model":[74],"do":[75],"not":[76],"reduce":[77],"these":[78],"lower":[79],"bounds.":[80],"The":[81],"features":[82],"include":[83],"presenting":[84],"input":[86],"in":[87],"blocks":[88],"up":[90],"log2":[92],"vertices,":[94,100],"recoloring":[95],"any":[96],"fraction":[97],"presorting":[101],"by":[103],"degree,":[104],"and":[105],"disclosing":[106],"adversary's":[108],"previous":[109],"coloring.":[110]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}