Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Cohesive Subgraph Search Over Large Heterogeneous Information NetworksPreliminaries

Cohesive Subgraph Search Over Large Heterogeneous Information Networks: Preliminaries [To formally introduce the research problem and solutions of CSS over HINs, people often follow some commonly-used notations and models to facilitate the presentation. Before reviewing the specific models and solutions in the following chapters, in this chapter we first formally introduce the data models of HINs and bipartite networks, and then review several typical classic CSMs on homogeneous networks, including k-core, k-truss, k-clique, k-edge-connectivity component (k-ECC), and the densest subgraphs.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Cohesive Subgraph Search Over Large Heterogeneous Information NetworksPreliminaries

Download PDF
2 pages

Loading next page...
 
/lp/springer-journals/cohesive-subgraph-search-over-large-heterogeneous-information-networks-eUwXkNxysX
Publisher
Springer International Publishing
Copyright
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2022
ISBN
978-3-030-97567-8
Pages
7 –9
DOI
10.1007/978-3-030-97568-5_2
Publisher site
See Chapter on Publisher Site

Abstract

[To formally introduce the research problem and solutions of CSS over HINs, people often follow some commonly-used notations and models to facilitate the presentation. Before reviewing the specific models and solutions in the following chapters, in this chapter we first formally introduce the data models of HINs and bipartite networks, and then review several typical classic CSMs on homogeneous networks, including k-core, k-truss, k-clique, k-edge-connectivity component (k-ECC), and the densest subgraphs.]

Published: Feb 23, 2022

There are no references for this article.