{"id":"https://openalex.org/W1979506099","doi":"https://doi.org/10.1016/s0304-3975(97)00254-5","title":"Efficient algorithms for acyclic colorings of graphs","display_name":"Efficient algorithms for acyclic colorings of graphs","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1979506099","doi":"https://doi.org/10.1016/s0304-3975(97)00254-5","mag":"1979506099"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(97)00254-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(97)00254-5","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/A5101483230","display_name":"Zhi\u2010Zhong Chen","orcid":"https://orcid.org/0000-0003-3061-1171"},"institutions":[{"id":"https://openalex.org/I165522056","display_name":"Tokyo Denki University","ror":"https://ror.org/01pa62v70","country_code":"JP","type":"education","lineage":["https://openalex.org/I165522056"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Zhi-Zhong Chen","raw_affiliation_strings":["Tokyo Denki University, Hatoyama, Saitama, Japan#TAB#"],"affiliations":[{"raw_affiliation_string":"Tokyo Denki University, Hatoyama, Saitama, Japan#TAB#","institution_ids":["https://openalex.org/I165522056"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101483230"],"corresponding_institution_ids":["https://openalex.org/I165522056"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.4692,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.64339115,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"230","issue":"1-2","first_page":"75","last_page":"95"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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.9878000020980835,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9812999963760376,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.6176497936248779},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5921152830123901},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4855074882507324},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4753919839859009},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3823765516281128},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38145381212234497}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6176497936248779},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5921152830123901},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4855074882507324},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4753919839859009},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3823765516281128},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38145381212234497}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0304-3975(97)00254-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(97)00254-5","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W181843685","https://openalex.org/W1489979173","https://openalex.org/W1496725729","https://openalex.org/W1965633932","https://openalex.org/W1978438623","https://openalex.org/W1985224030","https://openalex.org/W1989544707","https://openalex.org/W1995040285","https://openalex.org/W2001994005","https://openalex.org/W2004350101","https://openalex.org/W2033177550","https://openalex.org/W2045027193","https://openalex.org/W2046693802","https://openalex.org/W2048838677","https://openalex.org/W2101496488","https://openalex.org/W4285719527","https://openalex.org/W6658506697","https://openalex.org/W6661829240"],"related_works":["https://openalex.org/W2741410347","https://openalex.org/W2369914007","https://openalex.org/W4327810445","https://openalex.org/W1999075790","https://openalex.org/W2021962931","https://openalex.org/W1589642618","https://openalex.org/W2031344019","https://openalex.org/W2044224022","https://openalex.org/W2065756109","https://openalex.org/W2141380527"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}