{"id":"https://openalex.org/W2906338573","doi":"https://doi.org/10.1007/978-3-030-10564-8_15","title":"On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs","display_name":"On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs","publication_year":2018,"publication_date":"2018-12-20","ids":{"openalex":"https://openalex.org/W2906338573","doi":"https://doi.org/10.1007/978-3-030-10564-8_15","mag":"2906338573"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-10564-8_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-10564-8_15","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/A5043202535","display_name":"Y. B. Venkatakrishnan","orcid":"https://orcid.org/0000-0003-4560-2040"},"institutions":[{"id":"https://openalex.org/I932239252","display_name":"SASTRA University","ror":"https://ror.org/032jk8892","country_code":"IN","type":"education","lineage":["https://openalex.org/I932239252"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Y. B. Venkatakrishnan","raw_affiliation_strings":["Department of Mathematics, School of Humanities and Sciences, SASTRA Deemed University, Thanjavur, 613 401, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, School of Humanities and Sciences, SASTRA Deemed University, Thanjavur, 613 401, India","institution_ids":["https://openalex.org/I932239252"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090659552","display_name":"H. Naresh Kumar","orcid":"https://orcid.org/0009-0000-7620-4542"},"institutions":[{"id":"https://openalex.org/I932239252","display_name":"SASTRA University","ror":"https://ror.org/032jk8892","country_code":"IN","type":"education","lineage":["https://openalex.org/I932239252"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"H. Naresh Kumar","raw_affiliation_strings":["Department of Mathematics, School of Humanities and Sciences, SASTRA Deemed University, Thanjavur, 613 401, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, School of Humanities and Sciences, SASTRA Deemed University, Thanjavur, 613 401, India","institution_ids":["https://openalex.org/I932239252"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043202535"],"corresponding_institution_ids":["https://openalex.org/I932239252"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.9791,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.88288946,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"188","last_page":"198"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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.9991999864578247,"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.9980999827384949,"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/T12288","display_name":"Optimization and Search Problems","score":0.9943000078201294,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8150709867477417},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.7586097717285156},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7317171096801758},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6614527702331543},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.6176583766937256},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.5745775103569031},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49834489822387695},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.48575547337532043},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.47199395298957825},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4639406204223633},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39608117938041687},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3677555322647095},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13593131303787231},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.11184024810791016}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8150709867477417},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.7586097717285156},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7317171096801758},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6614527702331543},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.6176583766937256},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.5745775103569031},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49834489822387695},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.48575547337532043},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.47199395298957825},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4639406204223633},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39608117938041687},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3677555322647095},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13593131303787231},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.11184024810791016},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-10564-8_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-10564-8_15","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W624159443","https://openalex.org/W1493071618","https://openalex.org/W1980243423","https://openalex.org/W1997940755","https://openalex.org/W2038225707","https://openalex.org/W2051431590","https://openalex.org/W2113764055","https://openalex.org/W2663774503","https://openalex.org/W2987736872","https://openalex.org/W6634712007"],"related_works":["https://openalex.org/W2036594069","https://openalex.org/W4244658307","https://openalex.org/W2156896570","https://openalex.org/W2949255922","https://openalex.org/W2038655901","https://openalex.org/W4241472005","https://openalex.org/W1627181101","https://openalex.org/W2043560626","https://openalex.org/W1534786826","https://openalex.org/W2017302564"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}