{"id":"https://openalex.org/W2030013015","doi":"https://doi.org/10.1007/978-3-642-25591-5_12","title":"Dominating Induced Matchings for P 7-free Graphs in Linear Time","display_name":"Dominating Induced Matchings for P 7-free Graphs in Linear Time","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2030013015","doi":"https://doi.org/10.1007/978-3-642-25591-5_12","mag":"2030013015"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-25591-5_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-25591-5_12","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/A5085372854","display_name":"Andreas Brandst\u00e4dt","orcid":null},"institutions":[{"id":"https://openalex.org/I4665924","display_name":"University of Rostock","ror":"https://ror.org/03zdwsf69","country_code":"DE","type":"education","lineage":["https://openalex.org/I4665924"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas Brandst\u00e4dt","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Rostock, D-18051, Rostock, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Rostock, D-18051, Rostock, Germany","institution_ids":["https://openalex.org/I4665924"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040644152","display_name":"Raffaele Mosca","orcid":null},"institutions":[{"id":"https://openalex.org/I39387349","display_name":"University of Chieti-Pescara","ror":"https://ror.org/00qjgza05","country_code":"IT","type":"education","lineage":["https://openalex.org/I39387349"]},{"id":"https://openalex.org/I4210150903","display_name":"International Research School of Planetary Sciences","ror":"https://ror.org/05q6xw994","country_code":"IT","type":"nonprofit","lineage":["https://openalex.org/I4210150903"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Raffaele Mosca","raw_affiliation_strings":["Dipartimento di Scienze, Universit\u00e1 degli Studi \u201cG. D\u2019Annunzio\u201d, Pescara, 65121, Italy","Dipartimento di Scienze, Universit\u00e1 degli Studi \"G. D'Annunzio\", Pescara, 65121, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Scienze, Universit\u00e1 degli Studi \u201cG. D\u2019Annunzio\u201d, Pescara, 65121, Italy","institution_ids":["https://openalex.org/I39387349","https://openalex.org/I4210150903"]},{"raw_affiliation_string":"Dipartimento di Scienze, Universit\u00e1 degli Studi \"G. D'Annunzio\", Pescara, 65121, Italy","institution_ids":["https://openalex.org/I39387349"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.4787,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.9272549,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"100","last_page":"109"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9872000217437744,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.983299970626831,"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.8159191608428955},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7235689759254456},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.6033419966697693},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5545234680175781},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5401093363761902},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5238744616508484},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5034217238426208},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.49816298484802246},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4640699028968811},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45617079734802246},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3529711365699768},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.31301257014274597},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2578355073928833},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.12018603086471558}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8159191608428955},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7235689759254456},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.6033419966697693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5545234680175781},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5401093363761902},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5238744616508484},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5034217238426208},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.49816298484802246},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4640699028968811},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45617079734802246},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3529711365699768},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.31301257014274597},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2578355073928833},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.12018603086471558},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-25591-5_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-25591-5_12","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W639947448","https://openalex.org/W1486102037","https://openalex.org/W1493930654","https://openalex.org/W1526291627","https://openalex.org/W1546403474","https://openalex.org/W1570340896","https://openalex.org/W1576293797","https://openalex.org/W1579049696","https://openalex.org/W1655990431","https://openalex.org/W1976120600","https://openalex.org/W1978626345","https://openalex.org/W2000138132","https://openalex.org/W2002055996","https://openalex.org/W2011039300","https://openalex.org/W2015452703","https://openalex.org/W2015906942","https://openalex.org/W2030013015","https://openalex.org/W2040593601","https://openalex.org/W2041910029","https://openalex.org/W2047747666","https://openalex.org/W2047899424","https://openalex.org/W2053991811","https://openalex.org/W2086058377","https://openalex.org/W2092503911","https://openalex.org/W2097707821","https://openalex.org/W2114720692","https://openalex.org/W2170633983","https://openalex.org/W2444140751","https://openalex.org/W2950560392","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W300018836","https://openalex.org/W1966320878","https://openalex.org/W2935770235","https://openalex.org/W2906881967","https://openalex.org/W2991587872","https://openalex.org/W3118753906","https://openalex.org/W2954109725","https://openalex.org/W2952723382","https://openalex.org/W4301177232","https://openalex.org/W3037291746"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"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"}