{"id":"https://openalex.org/W1518003391","doi":"https://doi.org/10.1007/11560586_19","title":"On the Computational Complexity of the L (2,1)-Labeling Problem for Regular Graphs","display_name":"On the Computational Complexity of the L (2,1)-Labeling Problem for Regular Graphs","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1518003391","doi":"https://doi.org/10.1007/11560586_19","mag":"1518003391"},"language":"en","primary_location":{"id":"doi:10.1007/11560586_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11560586_19","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5088167330","display_name":"Ji\u0159\u0131\u0301 Fiala","orcid":"https://orcid.org/0000-0002-8108-567X"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Ji\u0159\u00ed Fiala","raw_affiliation_strings":["Institute for Theoretical Computer Science, and Department of Applied Mathematics, Charles University, Prague"],"affiliations":[{"raw_affiliation_string":"Institute for Theoretical Computer Science, and Department of Applied Mathematics, Charles University, Prague","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066646775","display_name":"Jan Kratochv\u0131\u0301l","orcid":"https://orcid.org/0000-0002-2620-6133"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Kratochv\u00edl","raw_affiliation_strings":["Institute for Theoretical Computer Science, and Department of Applied Mathematics, Charles University, Prague"],"affiliations":[{"raw_affiliation_string":"Institute for Theoretical Computer Science, and Department of Applied Mathematics, Charles University, Prague","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088167330"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.5573,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.65895954,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"228","last_page":"236"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","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/T12541","display_name":"Graph Labeling and Dimension Problems","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/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/T11797","display_name":"graph theory and CDMA systems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7679661512374878},{"id":"https://openalex.org/keywords/graph-labeling","display_name":"Graph labeling","score":0.6172550916671753},{"id":"https://openalex.org/keywords/edge-graceful-labeling","display_name":"Edge-graceful labeling","score":0.6051256060600281},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5471094250679016},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.500699520111084},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4750792384147644},{"id":"https://openalex.org/keywords/span","display_name":"Span (engineering)","score":0.43557441234588623},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4311586916446686},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.4173579812049866},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41052594780921936},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39409348368644714},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.22604617476463318},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19077184796333313},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10913273692131042}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7679661512374878},{"id":"https://openalex.org/C166513658","wikidata":"https://www.wikidata.org/wiki/Q5597093","display_name":"Graph labeling","level":5,"score":0.6172550916671753},{"id":"https://openalex.org/C150433608","wikidata":"https://www.wikidata.org/wiki/Q5337633","display_name":"Edge-graceful labeling","level":5,"score":0.6051256060600281},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5471094250679016},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.500699520111084},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4750792384147644},{"id":"https://openalex.org/C2778753569","wikidata":"https://www.wikidata.org/wiki/Q1960395","display_name":"Span (engineering)","level":2,"score":0.43557441234588623},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4311586916446686},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4173579812049866},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41052594780921936},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39409348368644714},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.22604617476463318},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19077184796333313},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10913273692131042},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C147176958","wikidata":"https://www.wikidata.org/wiki/Q77590","display_name":"Civil engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11560586_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11560586_19","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1985986630","https://openalex.org/W2011039300","https://openalex.org/W2044716204","https://openalex.org/W2056979696","https://openalex.org/W2071020031","https://openalex.org/W2072651004","https://openalex.org/W2074820146","https://openalex.org/W2077376532","https://openalex.org/W2148410650","https://openalex.org/W2166566648","https://openalex.org/W2184661648"],"related_works":["https://openalex.org/W2186458673","https://openalex.org/W115645095","https://openalex.org/W3215888473","https://openalex.org/W3187629674","https://openalex.org/W3119677583","https://openalex.org/W3092866983","https://openalex.org/W29790421","https://openalex.org/W2955778118","https://openalex.org/W2276429555","https://openalex.org/W2059234654"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}