{"id":"https://openalex.org/W2293966941","doi":"https://doi.org/10.1109/bigcomp.2016.7425941","title":"Sparsifying and sampling of large graphs for efficient dense subgraph detection","display_name":"Sparsifying and sampling of large graphs for efficient dense subgraph detection","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2293966941","doi":"https://doi.org/10.1109/bigcomp.2016.7425941","mag":"2293966941"},"language":"en","primary_location":{"id":"doi:10.1109/bigcomp.2016.7425941","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigcomp.2016.7425941","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Big Data and Smart Computing (BigComp)","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/A5049540608","display_name":"Kai Cheng","orcid":"https://orcid.org/0000-0003-4565-8036"},"institutions":[{"id":"https://openalex.org/I199028557","display_name":"Kyushu Sangyo University","ror":"https://ror.org/01wqrpc44","country_code":"JP","type":"education","lineage":["https://openalex.org/I199028557"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Kai Cheng","raw_affiliation_strings":["Faculty of Information Science, Kyushu Sangyo University, Fukuoka, Japan"],"affiliations":[{"raw_affiliation_string":"Faculty of Information Science, Kyushu Sangyo University, Fukuoka, Japan","institution_ids":["https://openalex.org/I199028557"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5049540608"],"corresponding_institution_ids":["https://openalex.org/I199028557"],"apc_list":null,"apc_paid":null,"fwci":0.221,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.5566701,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"333","last_page":"336"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9970999956130981,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9968000054359436,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7258522510528564},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.7254374027252197},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.5806137919425964},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5316921472549438},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.5209816098213196},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41513779759407043},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.41203773021698},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2736443281173706},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16052287817001343}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7258522510528564},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.7254374027252197},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.5806137919425964},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5316921472549438},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.5209816098213196},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41513779759407043},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.41203773021698},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2736443281173706},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16052287817001343},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigcomp.2016.7425941","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigcomp.2016.7425941","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Big Data and Smart Computing (BigComp)","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":11,"referenced_works":["https://openalex.org/W1991800036","https://openalex.org/W2013414394","https://openalex.org/W2054560566","https://openalex.org/W2103799649","https://openalex.org/W2118446779","https://openalex.org/W2123963758","https://openalex.org/W2137135938","https://openalex.org/W2217968126","https://openalex.org/W2755088640","https://openalex.org/W4231916799","https://openalex.org/W6744271739"],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W167435155","https://openalex.org/W2953496651","https://openalex.org/W2886672068","https://openalex.org/W2604114816","https://openalex.org/W231720905","https://openalex.org/W2811238889","https://openalex.org/W2397707437","https://openalex.org/W1992416685","https://openalex.org/W3151217588"],"abstract_inverted_index":{"Dense":[0],"subgraph":[1,59,83],"detection":[2,60],"is":[3],"one":[4,48],"of":[5,26],"the":[6,29,37,63,93],"most":[7,33],"important":[8],"topics":[9],"in":[10,75],"graph":[11,77],"analysis.":[12],"Most":[13],"previous":[14],"work":[15],"on":[16],"this":[17,53],"issue":[18],"assume":[19],"an":[20,80],"adjacency":[21],"list":[22],"or":[23],"a":[24,57,76],"stream":[25],"edges":[27],"for":[28],"target":[30],"graph.":[31],"In":[32,52],"real":[34],"applications":[35],"however,":[36],"underlying":[38],"graphs":[39],"only":[40],"allow":[41],"navigational":[42,64],"access":[43,65],"by":[44],"following":[45],"links":[46],"from":[47],"node":[49],"to":[50,71,91],"another.":[51],"paper,":[54],"we":[55],"propose":[56],"dense":[58,73,82],"technique":[61],"under":[62],"model.":[66],"We":[67],"use":[68],"neighborhood":[69],"density":[70],"measure":[72],"components":[74],"and":[78],"develop":[79],"efficient":[81],"finding":[84],"algorithm.":[85],"Preliminary":[86],"experiments":[87],"are":[88],"carried":[89],"out":[90],"evaluate":[92],"proposed":[94],"scheme.":[95]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}