{"id":"https://openalex.org/W1943184251","doi":"https://doi.org/10.3233/fi-2009-164","title":"Mining the Largest Dense Vertexlet in a Weighted Scale-free Graph","display_name":"Mining the Largest Dense Vertexlet in a Weighted Scale-free Graph","publication_year":2009,"publication_date":"2009-10-01","ids":{"openalex":"https://openalex.org/W1943184251","doi":"https://doi.org/10.3233/fi-2009-164","mag":"1943184251"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2009-164","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2009-164","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","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/A5036061149","display_name":"Sanghamitra Bandyopadhyay","orcid":"https://orcid.org/0000-0001-6370-2083"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sanghamitra Bandyopadhyay","raw_affiliation_strings":["Machine Intelligence Unit, Indian Statistical Institute,\r\t\t\t 203 B. T. Road, Kolkata - 700108, India. E-mail: {sanghami,malay_r}@isical.ac.in","Machine Intelligence Unit, Indian Statistical Institute, 203 B. T. Road, Kolkata - 700108, India. E-mail: {sanghami,malay_r}@isical.ac.in#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Machine Intelligence Unit, Indian Statistical Institute,\r\t\t\t 203 B. T. Road, Kolkata - 700108, India. E-mail: {sanghami,malay_r}@isical.ac.in","institution_ids":["https://openalex.org/I6498739"]},{"raw_affiliation_string":"Machine Intelligence Unit, Indian Statistical Institute, 203 B. T. Road, Kolkata - 700108, India. E-mail: {sanghami,malay_r}@isical.ac.in#TAB#","institution_ids":["https://openalex.org/I6498739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040278918","display_name":"Malay Bhattacharyya","orcid":"https://orcid.org/0000-0001-7781-1264"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Malay Bhattacharyya","raw_affiliation_strings":["Machine Intelligence Unit, Indian Statistical Institute,\r\t\t\t 203 B. T. Road, Kolkata - 700108, India. E-mail: {sanghami,malay_r}@isical.ac.in","Machine Intelligence Unit, Indian Statistical Institute, 203 B. T. Road, Kolkata - 700108, India. E-mail: {sanghami,malay_r}@isical.ac.in#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Machine Intelligence Unit, Indian Statistical Institute,\r\t\t\t 203 B. T. Road, Kolkata - 700108, India. E-mail: {sanghami,malay_r}@isical.ac.in","institution_ids":["https://openalex.org/I6498739"]},{"raw_affiliation_string":"Machine Intelligence Unit, Indian Statistical Institute, 203 B. T. Road, Kolkata - 700108, India. E-mail: {sanghami,malay_r}@isical.ac.in#TAB#","institution_ids":["https://openalex.org/I6498739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.8363,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.89747725,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"96","issue":"1-2","first_page":"1","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9969000220298767,"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.9969000220298767,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9934999942779541,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.989799976348877,"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.6930166482925415},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6617094278335571},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.5964763164520264},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5062164664268494},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47656774520874023},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.4484545886516571},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4415787160396576},{"id":"https://openalex.org/keywords/strength-of-a-graph","display_name":"Strength of a graph","score":0.41574227809906006},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2977418899536133}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6930166482925415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6617094278335571},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.5964763164520264},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5062164664268494},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47656774520874023},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.4484545886516571},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4415787160396576},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.41574227809906006},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2977418899536133},{"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.3233/fi-2009-164","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2009-164","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"id":"https://metadata.un.org/sdg/12","display_name":"Responsible consumption and production"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1516636018","https://openalex.org/W1996797249","https://openalex.org/W2002747011","https://openalex.org/W2008620264","https://openalex.org/W2011039300","https://openalex.org/W2018407943","https://openalex.org/W2019853242","https://openalex.org/W2046112356","https://openalex.org/W2046618236","https://openalex.org/W2081254453","https://openalex.org/W2082603400","https://openalex.org/W2105038944","https://openalex.org/W2108455025","https://openalex.org/W2109970232","https://openalex.org/W2121821841","https://openalex.org/W2124388496","https://openalex.org/W2137474062","https://openalex.org/W2140190241","https://openalex.org/W2141146725","https://openalex.org/W2148995578","https://openalex.org/W2150926065","https://openalex.org/W2153233077","https://openalex.org/W2158745320","https://openalex.org/W2160556205","https://openalex.org/W2171118759","https://openalex.org/W2999729612","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4288436438","https://openalex.org/W1995383828","https://openalex.org/W4298388358","https://openalex.org/W2226543729","https://openalex.org/W4246526124","https://openalex.org/W4383602045","https://openalex.org/W2982283786","https://openalex.org/W2261714462","https://openalex.org/W2083394054","https://openalex.org/W3165722755"],"abstract_inverted_index":{"An":[0,133],"important":[1],"problem":[2,63,128,184],"of":[3,19,27,36,51,64,71,91,96,103,116,139,144,168],"knowledge":[4],"discovery":[5],"that":[6,21,73,112,126,177],"has":[7],"recently":[8],"evolved":[9],"in":[10,57,80,98,108,131,170],"various":[11],"reallife":[12],"networks":[13,30,54],"is":[14,85,106,124,129,155,185],"identifying":[15],"the":[16,34,37,46,52,62,66,89,118,121,127,137,140,166,171,183],"largest":[17,67,141],"set":[18],"vertices":[20,35,72,97,119,169],"are":[22,55,74],"functionally":[23],"associated.":[24],"The":[25,101],"topology":[26],"many":[28],"real-life":[29,53],"shows":[31],"scale-freeness,":[32],"where":[33],"underlying":[38],"graph":[39,84,174],"follow":[40],"a":[41,81,94,99,104,109,145],"power-law":[42],"degree":[43,90],"distribution.":[44],"Moreover,":[45],"graphs":[47],"corresponding":[48],"to":[49,150],"most":[50],"weighted":[56,82,146],"nature.":[58,132],"In":[59],"this":[60],"article,":[61],"finding":[65],"group":[68,95],"or":[69],"association":[70],"dense":[75,78,142],"(denoted":[76],"as":[77],"vertexlet)":[79],"scale-free":[83],"addressed.":[86],"Density":[87],"quantifies":[88],"similarity":[92],"within":[93,120],"graph.":[100],"density":[102,152],"vertexlet":[105,143],"defined":[107],"novel":[110],"way":[111],"ensures":[113],"significant":[114],"participation":[115],"all":[117],"vertexlet.":[122],"It":[123],"established":[125],"NP-complete":[130],"upper":[134],"bound":[135],"on":[136],"order":[138],"graph,":[147],"with":[148],"respect":[149],"certain":[151],"threshold":[153],"value,":[154],"also":[156],"derived.":[157],"Finally,":[158],"an":[159,179],"O(n":[160],"$^2$":[161],"log":[162],"n)":[163],"(n":[164],"denotes":[165],"number":[167],"graph)":[172],"heuristic":[173],"mining":[175],"algorithm":[176],"produces":[178],"approximate":[180],"solution":[181],"for":[182],"presented.":[186]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}