Finding Subgraphs with Maximum Total Density and Limited Overlap in Weighted Hypergraphs.
Saved in:
| Title: | Finding Subgraphs with Maximum Total Density and Limited Overlap in Weighted Hypergraphs. |
|---|---|
| Authors: | Balalau, Oana1, oana.balalau@inria.fr, Bonchi, Francesco2, bonchi@centai.eu, Chan, T-H. Hubert3, hubert@cs.hku.hk, Gullo, Francesco4, gullof@acm.org, Sozio, Mauro5, sozio@telecom-paristech.fr, Xie, Hao3, hxie@connect.hku.hk |
| Source: | ACM Transactions on Knowledge Discovery from Data; May2024, Vol. 18 Issue 4, p1-21, 21p |
| Database: | Applied Science & Technology Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: aci DbLabel: Applied Science & Technology Source An: 175564680 AccessLevel: 2 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Finding Subgraphs with Maximum Total Density and Limited Overlap in Weighted Hypergraphs. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AU" term="%22Balalau%2C+Oana%22">Balalau, Oana</searchLink><relatesTo>1</relatesTo>, <i>oana.balalau@inria.fr</i><br /><searchLink fieldCode="AU" term="%22Bonchi%2C+Francesco%22">Bonchi, Francesco</searchLink><relatesTo>2</relatesTo>, <i>bonchi@centai.eu</i><br /><searchLink fieldCode="AU" term="%22Chan%2C+T-H%2E+Hubert%22">Chan, T-H. Hubert</searchLink><relatesTo>3</relatesTo>, <i>hubert@cs.hku.hk</i><br /><searchLink fieldCode="AU" term="%22Gullo%2C+Francesco%22">Gullo, Francesco</searchLink><relatesTo>4</relatesTo>, <i>gullof@acm.org</i><br /><searchLink fieldCode="AU" term="%22Sozio%2C+Mauro%22">Sozio, Mauro</searchLink><relatesTo>5</relatesTo>, <i>sozio@telecom-paristech.fr</i><br /><searchLink fieldCode="AU" term="%22Xie%2C+Hao%22">Xie, Hao</searchLink><relatesTo>3</relatesTo>, <i>hxie@connect.hku.hk</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22ACM+Transactions+on+Knowledge+Discovery+from+Data%22">ACM Transactions on Knowledge Discovery from Data</searchLink>; May2024, Vol. 18 Issue 4, p1-21, 21p |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=aci&AN=175564680 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1145/3639410 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 21 StartPage: 1 Titles: – TitleFull: Finding Subgraphs with Maximum Total Density and Limited Overlap in Weighted Hypergraphs. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Balalau, Oana – PersonEntity: Name: NameFull: Bonchi, Francesco – PersonEntity: Name: NameFull: Chan, T-H. Hubert – PersonEntity: Name: NameFull: Gullo, Francesco – PersonEntity: Name: NameFull: Sozio, Mauro – PersonEntity: Name: NameFull: Xie, Hao IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 05 Text: May2024 Type: published Y: 2024 Identifiers: – Type: issn-print Value: 15564681 Numbering: – Type: volume Value: 18 – Type: issue Value: 4 Titles: – TitleFull: ACM Transactions on Knowledge Discovery from Data Type: main |
| ResultId | 1 |