{"id":"https://openalex.org/W2311696722","doi":"https://doi.org/10.1109/comsnets.2016.7439954","title":"An algorithm to search edge relaxed query graph with minimum support threshold in large communication networks","display_name":"An algorithm to search edge relaxed query graph with minimum support threshold in large communication networks","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2311696722","doi":"https://doi.org/10.1109/comsnets.2016.7439954","mag":"2311696722"},"language":"en","primary_location":{"id":"doi:10.1109/comsnets.2016.7439954","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comsnets.2016.7439954","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","raw_type":"proceedings-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/A5070272688","display_name":"Nirmala Parisutham","orcid":"https://orcid.org/0000-0002-7892-5252"},"institutions":[{"id":"https://openalex.org/I4210109528","display_name":"PSG INSTITUTE OF TECHNOLOGY AND APPLIED RESEARCH","ror":"https://ror.org/01sa9ng67","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210109528"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Nirmala Parisutham","raw_affiliation_strings":["Department of Applied Mathematics and Computational Sciences, PSG College of Technology, Coimbatore, India"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Computational Sciences, PSG College of Technology, Coimbatore, India","institution_ids":["https://openalex.org/I4210109528"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103982883","display_name":"Nadarajan Rethnasamy","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109528","display_name":"PSG INSTITUTE OF TECHNOLOGY AND APPLIED RESEARCH","ror":"https://ror.org/01sa9ng67","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210109528"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Nadarajan Rethnasamy","raw_affiliation_strings":["Department of Applied Mathematics and Computational Sciences, PSG College of Technology, Coimbatore, India"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Computational Sciences, PSG College of Technology, Coimbatore, India","institution_ids":["https://openalex.org/I4210109528"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5070272688"],"corresponding_institution_ids":["https://openalex.org/I4210109528"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.01126085,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9898999929428101,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9898999929428101,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.7298290133476257},{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.5665268301963806},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.5190137624740601},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.5166533589363098},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.4884861707687378},{"id":"https://openalex.org/keywords/butterfly-graph","display_name":"Butterfly graph","score":0.4732421338558197},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.4620461165904999},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.45043328404426575},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.4404883086681366},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4351658225059509},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4322197437286377},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.4242745637893677},{"id":"https://openalex.org/keywords/strength-of-a-graph","display_name":"Strength of a graph","score":0.42396080493927},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.1669250726699829}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7298290133476257},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.5665268301963806},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.5190137624740601},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.5166533589363098},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.4884861707687378},{"id":"https://openalex.org/C18819970","wikidata":"https://www.wikidata.org/wiki/Q3035340","display_name":"Butterfly graph","level":5,"score":0.4732421338558197},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.4620461165904999},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.45043328404426575},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.4404883086681366},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4351658225059509},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4322197437286377},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.4242745637893677},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.42396080493927},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.1669250726699829}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/comsnets.2016.7439954","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comsnets.2016.7439954","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 8th International Conference on Communication Systems and Networks (COMSNETS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W68973316","https://openalex.org/W1141563404","https://openalex.org/W1490437675","https://openalex.org/W1967497571","https://openalex.org/W2050137450","https://openalex.org/W2102913801","https://openalex.org/W2107952582","https://openalex.org/W2109294083"],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W167435155","https://openalex.org/W2052731309","https://openalex.org/W2376177032","https://openalex.org/W2562224395","https://openalex.org/W2793949464","https://openalex.org/W2997001386","https://openalex.org/W2093879314","https://openalex.org/W3169403755","https://openalex.org/W2311696722"],"abstract_inverted_index":{"With":[0],"the":[1,17,29,36,49,59,66,79,87,90,96,110,113,116,123,130,133,150,159,166,172,177,180,184],"increasing":[2],"scale":[3],"and":[4,47,82],"complexity":[5],"of":[6,20,24,61,89,118,122,132,140,179],"today's":[7],"communication":[8,25,51,80],"network,":[9],"it":[10,83],"is":[11,40,54,76,126,153],"becoming":[12],"more":[13],"essential":[14],"to":[15,27,57,69,85,128,175],"find":[16,176],"frequent":[18,50,154],"subgraph":[19,178],"a":[21,62,100],"time":[22],"series":[23],"network":[26,81],"predict":[28],"nodes":[30,91],"which":[31,92,147],"are":[32,93],"often":[33,55],"involved":[34],"in":[35,42,65,78,95,112,158],"communication.":[37],"This":[38,142],"knowledge":[39],"useful":[41],"devising":[43],"new":[44],"routing":[45],"algorithms,":[46],"understanding":[48],"patterns.":[52],"It":[53],"required":[56],"determine":[58,129],"frequency":[60,131],"query":[63,74,97,101,124,134,151,173,181],"graph":[64,67,75,102,114,125,135,152,160,174,182],"database":[68],"realize":[70],"how":[71],"much":[72],"that":[73],"occurred":[77],"facilitates":[84],"monitor":[86],"performance":[88],"presented":[94],"graph.":[98],"When":[99],"does":[103],"not":[104,163],"have":[105],"an":[106,145],"exact":[107],"match":[108,121],"with":[109,183],"graphs":[111],"database,":[115,161],"idea":[117],"finding":[119],"approximate":[120],"coined":[127],"by":[136],"relaxing":[137],"few":[138],"edges":[139,170],"it.":[141],"paper":[143],"presents":[144],"algorithm":[146,167],"decides":[148],"whether":[149],"as":[155],"expected":[156],"times":[157],"if":[162],"so":[164],"then":[165],"relax":[168],"infrequent":[169],"from":[171],"given":[185],"minimum":[186],"support":[187],"threshold.":[188]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}