{"id":"https://openalex.org/W4387405832","doi":"https://doi.org/10.1007/s13278-023-01136-2","title":"Dense subgraphs in temporal social networks","display_name":"Dense subgraphs in temporal social networks","publication_year":2023,"publication_date":"2023-10-06","ids":{"openalex":"https://openalex.org/W4387405832","doi":"https://doi.org/10.1007/s13278-023-01136-2"},"language":"en","primary_location":{"id":"doi:10.1007/s13278-023-01136-2","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s13278-023-01136-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s13278-023-01136-2.pdf","source":{"id":"https://openalex.org/S2764891196","display_name":"Social Network Analysis and Mining","issn_l":"1869-5450","issn":["1869-5450","1869-5469"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Social Network Analysis and Mining","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s13278-023-01136-2.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059320347","display_name":"Riccardo Dondi","orcid":"https://orcid.org/0000-0002-6124-2965"},"institutions":[{"id":"https://openalex.org/I11039511","display_name":"University of Bergamo","ror":"https://ror.org/02mbd5571","country_code":"IT","type":"education","lineage":["https://openalex.org/I11039511"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Riccardo Dondi","raw_affiliation_strings":["Universit\u00e0 degli Studi di Bergamo, Bergamo, Italy"],"affiliations":[{"raw_affiliation_string":"Universit\u00e0 degli Studi di Bergamo, Bergamo, Italy","institution_ids":["https://openalex.org/I11039511"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037399554","display_name":"Pietro Hiram Guzzi","orcid":"https://orcid.org/0000-0001-5542-2997"},"institutions":[{"id":"https://openalex.org/I36443711","display_name":"Magna Graecia University","ror":"https://ror.org/0530bdk91","country_code":"IT","type":"education","lineage":["https://openalex.org/I36443711"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Pietro Hiram Guzzi","raw_affiliation_strings":["Data Analytics Research Centre, University of Catanzaro, Catanzaro, Italy","Magna Graecia University, Catanzaro, Italy"],"affiliations":[{"raw_affiliation_string":"Data Analytics Research Centre, University of Catanzaro, Catanzaro, Italy","institution_ids":["https://openalex.org/I36443711"]},{"raw_affiliation_string":"Magna Graecia University, Catanzaro, Italy","institution_ids":["https://openalex.org/I36443711"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034996367","display_name":"Mohammad Mehdi Hosseinzadeh","orcid":"https://orcid.org/0000-0003-3275-6286"},"institutions":[{"id":"https://openalex.org/I11039511","display_name":"University of Bergamo","ror":"https://ror.org/02mbd5571","country_code":"IT","type":"education","lineage":["https://openalex.org/I11039511"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Mohammad Mehdi Hosseinzadeh","raw_affiliation_strings":["Universit\u00e0 degli Studi di Bergamo, Bergamo, Italy"],"affiliations":[{"raw_affiliation_string":"Universit\u00e0 degli Studi di Bergamo, Bergamo, Italy","institution_ids":["https://openalex.org/I11039511"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014008135","display_name":"Marianna Milano","orcid":"https://orcid.org/0000-0003-1561-725X"},"institutions":[{"id":"https://openalex.org/I36443711","display_name":"Magna Graecia University","ror":"https://ror.org/0530bdk91","country_code":"IT","type":"education","lineage":["https://openalex.org/I36443711"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Marianna Milano","raw_affiliation_strings":["Data Analytics Research Centre, University of Catanzaro, Catanzaro, Italy","Magna Graecia University, Catanzaro, Italy"],"affiliations":[{"raw_affiliation_string":"Data Analytics Research Centre, University of Catanzaro, Catanzaro, Italy","institution_ids":["https://openalex.org/I36443711"]},{"raw_affiliation_string":"Magna Graecia University, Catanzaro, Italy","institution_ids":["https://openalex.org/I36443711"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5059320347"],"corresponding_institution_ids":["https://openalex.org/I11039511"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.4035,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.6268909,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"13","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9984999895095825,"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"}},"topics":[{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9984999895095825,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.996999979019165,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9894999861717224,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7362504005432129},{"id":"https://openalex.org/keywords/timestamp","display_name":"Timestamp","score":0.7361006140708923},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5327914357185364},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.520077645778656},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5040439963340759},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4818324148654938},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4698459506034851},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4498511850833893},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4352208971977234},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3019329905509949},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1892293393611908},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17427149415016174}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7362504005432129},{"id":"https://openalex.org/C113954288","wikidata":"https://www.wikidata.org/wiki/Q186885","display_name":"Timestamp","level":2,"score":0.7361006140708923},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5327914357185364},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.520077645778656},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5040439963340759},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4818324148654938},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4698459506034851},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4498511850833893},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4352208971977234},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3019329905509949},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1892293393611908},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17427149415016174},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s13278-023-01136-2","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s13278-023-01136-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s13278-023-01136-2.pdf","source":{"id":"https://openalex.org/S2764891196","display_name":"Social Network Analysis and Mining","issn_l":"1869-5450","issn":["1869-5450","1869-5469"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Social Network Analysis and Mining","raw_type":"journal-article"},{"id":"pmh:oai:aisberg.unibg.it:10446/261619","is_oa":true,"landing_page_url":"https://hdl.handle.net/10446/261619","pdf_url":"https://aisberg.unibg.it/bitstream/10446/261619/1/SNAM23.pdf","source":{"id":"https://openalex.org/S4377196347","display_name":"Aisberg (University of Bergamo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I11039511","host_organization_name":"University of Bergamo","host_organization_lineage":["https://openalex.org/I11039511"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s13278-023-01136-2","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s13278-023-01136-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s13278-023-01136-2.pdf","source":{"id":"https://openalex.org/S2764891196","display_name":"Social Network Analysis and Mining","issn_l":"1869-5450","issn":["1869-5450","1869-5469"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Social Network Analysis and Mining","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.4099999964237213}],"awards":[],"funders":[{"id":"https://openalex.org/F4320316219","display_name":"Universit\u00e0 degli studi di Bergamo","ror":"https://ror.org/02mbd5571"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4387405832.pdf"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W156925849","https://openalex.org/W183656749","https://openalex.org/W1535144194","https://openalex.org/W2047923585","https://openalex.org/W2244843312","https://openalex.org/W2341328930","https://openalex.org/W2398413754","https://openalex.org/W2625026177","https://openalex.org/W2776104937","https://openalex.org/W2963993884","https://openalex.org/W2966573219","https://openalex.org/W3005431696","https://openalex.org/W3009975428","https://openalex.org/W3037819556","https://openalex.org/W3089683323","https://openalex.org/W3090404856","https://openalex.org/W3096155759","https://openalex.org/W3138984256","https://openalex.org/W3166805898","https://openalex.org/W3199947862","https://openalex.org/W4214721934","https://openalex.org/W4226323199","https://openalex.org/W4300773848","https://openalex.org/W4313400218","https://openalex.org/W4319994565"],"related_works":["https://openalex.org/W2060561905","https://openalex.org/W1417711376","https://openalex.org/W1986883493","https://openalex.org/W2469862403","https://openalex.org/W2166378262","https://openalex.org/W4379524643","https://openalex.org/W2035891203","https://openalex.org/W2367807705","https://openalex.org/W3029152356","https://openalex.org/W2054792846"],"abstract_inverted_index":{"Abstract":[0],"Interactions":[1],"among":[2,23],"entities":[3,24],"are":[4],"usually":[5],"modeled":[6],"using":[7],"graphs.":[8],"In":[9,57],"many":[10],"real":[11,173],"scenarios,":[12],"these":[13],"relations":[14],"may":[15],"change":[16,45],"over":[17,46],"time,":[18],"and":[19,48,97,120,136,162],"different":[20,55],"kinds":[21],"exist":[22],"that":[25,69,143],"need":[26],"to":[27,40,49,130],"be":[28],"integrated.":[29],"We":[30,141],"introduce":[31],"a":[32,63,91,115,121,137,168,172],"new":[33,59],"network":[34],"model":[35],"called":[36],"temporal":[37,87,93,134,157,175],"dual":[38,92,174],"network,":[39],"deal":[41,76],"with":[42,77],"interactions":[43],"which":[44],"time":[47],"integrate":[50],"information":[51],"coming":[52],"from":[53,151],"two":[54,86],"networks.":[56],"this":[58,78,106,110],"model,":[60],"we":[61,80,113,166],"consider":[62,131],"fundamental":[64],"problem":[65],"in":[66,105],"graph":[67,94],"mining,":[68],"is,":[70],"finding":[71],"the":[72,102,127,152],"densest":[73,103],"subgraphs.":[74],"To":[75],"problem,":[79,112],"propose":[81],"an":[82],"approach":[83],"that,":[84],"given":[85],"graphs,":[88],"(1)":[89],"produces":[90],"via":[95],"alignment":[96],"(2)":[98],"asks":[99],"for":[100,156],"identifying":[101],"subgraphs":[104],"resulting":[107],"graph.":[108],"For":[109],"latter":[111],"present":[114,167],"polynomial-time":[116],"dynamic":[117,128],"programming":[118,129],"algorithm":[119],"faster":[122],"heuristic":[123],"based":[124],"on":[125,171],"constraining":[126],"only":[132],"bounded":[133],"graphs":[135,158],"local":[138],"search":[139],"procedure.":[140],"show":[142],"our":[144],"method":[145],"can":[146],"output":[147],"solutions":[148],"not":[149],"far":[150],"optimal":[153],"ones,":[154],"even":[155],"having":[159],"10000":[160,163],"vertices":[161],"timestamps.":[164],"Finally,":[165],"case":[169],"study":[170],"network.":[176]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}