{"id":"https://openalex.org/W2064938171","doi":"https://doi.org/10.1142/s1793830914500189","title":"ALGORITHMS ON SUBGRAPH OVERLAP GRAPHS","display_name":"ALGORITHMS ON SUBGRAPH OVERLAP GRAPHS","publication_year":2014,"publication_date":"2014-01-17","ids":{"openalex":"https://openalex.org/W2064938171","doi":"https://doi.org/10.1142/s1793830914500189","mag":"2064938171"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830914500189","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830914500189","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5078313840","display_name":"F\u01cenic\u01ce Gavril","orcid":"https://orcid.org/0000-0001-9584-2232"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"FANICA GAVRIL","raw_affiliation_strings":["Computer Science Department, Technion, Haifa 32000, Israel","Computer Science Department, Technion,#N#Haifa 32000, Israel"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Technion, Haifa 32000, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Computer Science Department, Technion,#N#Haifa 32000, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078313840"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":1.0682,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78074089,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"06","issue":"02","first_page":"1450018","last_page":"1450018"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.998199999332428,"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.9959999918937683,"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.8201296925544739},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5795226097106934},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5787197351455688},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.5523487329483032},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.5457190871238708},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5100765824317932},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.48139524459838867},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.481205016374588},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.4321556091308594},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.4261956512928009},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3674187958240509},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.32531142234802246},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.22417467832565308},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.13556107878684998},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.12424710392951965},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.05074140429496765}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8201296925544739},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5795226097106934},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5787197351455688},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.5523487329483032},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.5457190871238708},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5100765824317932},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.48139524459838867},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.481205016374588},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.4321556091308594},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.4261956512928009},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3674187958240509},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.32531142234802246},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.22417467832565308},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.13556107878684998},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.12424710392951965},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.05074140429496765}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830914500189","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830914500189","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1490430289","https://openalex.org/W1520704862","https://openalex.org/W1589640109","https://openalex.org/W1964982423","https://openalex.org/W1968027460","https://openalex.org/W1978452004","https://openalex.org/W1985219252","https://openalex.org/W1995409416","https://openalex.org/W2011039300","https://openalex.org/W2017814971","https://openalex.org/W2030398678","https://openalex.org/W2052186517","https://openalex.org/W2060438030","https://openalex.org/W2060670627","https://openalex.org/W2061237693","https://openalex.org/W2065908606","https://openalex.org/W2071616675","https://openalex.org/W2077665273","https://openalex.org/W2077900886","https://openalex.org/W2078024271","https://openalex.org/W2144393227","https://openalex.org/W2152495216","https://openalex.org/W2175518075","https://openalex.org/W2334138522"],"related_works":["https://openalex.org/W91714901","https://openalex.org/W2032950096","https://openalex.org/W2789630860","https://openalex.org/W2367468405","https://openalex.org/W2007346569","https://openalex.org/W2957388536","https://openalex.org/W2081611194","https://openalex.org/W1551696500","https://openalex.org/W1985573889","https://openalex.org/W2604168044"],"abstract_inverted_index":{"Consider":[0],"a":[1,5,63,71],"graph":[2,20,27],"D":[3],"and":[4,23,74,91,93],"family":[6,82,102],"FI":[7,22,90],"of":[8,12,21,28,62,70,83,103],"connected":[9],"edge":[10],"subgraphs":[11],"D.":[13],"Let":[14],"GI(V,":[15],"F)":[16],"be":[17,97],"the":[18,25,81,98,101],"intersection":[19,42],"G":[24,39],"overlap":[26,37,105],"FI.":[29],"We":[30],"describe":[31],"polynomial":[32],"time":[33],"algorithms":[34,50],"for":[35],"subgraph":[36,84,104],"graphs":[38,43,86],"when":[40],"their":[41],"GI":[44],"have":[45],"specific":[46],"hereditary":[47],"properties.":[48],"The":[49],"are":[51],"to":[52,96],"find":[53],"maximum":[54,59],"induced":[55],"complete":[56],"bipartite":[57],"subgraphs,":[58],"weight":[60],"holes":[61],"given":[64,72],"parity,":[65],"minimum":[66],"dominating":[67],"holes,":[68],"antiholes":[69],"parity":[73],"some":[75],"others.":[76],"In":[77],"addition,":[78],"we":[79],"define":[80],"filament":[85],"based":[87],"on":[88],"D,":[89],"GI,":[92],"prove":[94],"it":[95],"same":[99],"as":[100],"graphs.":[106]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}