Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Efficient and effective community search on large-scale bipartite graphs
Bipartite graphs are widely used to model relation-ships between two types of entities.
Community search retrieves densely connected subgraphs containing a query vertex, which …
Community search retrieves densely connected subgraphs containing a query vertex, which …
Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs
In recent years, cohesive subgraph mining in bipartite graphs becomes a popular research
topic. An important cohesive subgraph model k-bitruss is the maximal cohesive subgraph …
topic. An important cohesive subgraph model k-bitruss is the maximal cohesive subgraph …
Cohesive subgraph search over big heterogeneous information networks: Applications, challenges, and solutions
With the advent of a wide spectrum of recent applications, querying heterogeneous
information networks (HINs) has received a great deal of attention from both academic and …
information networks (HINs) has received a great deal of attention from both academic and …
Efficient personalized maximum biclique search
Bipartite graphs are naturally used to model relationships between two different types of
entities. On bipartite graphs, maximum biclique search is a fundamental problem that aims to …
entities. On bipartite graphs, maximum biclique search is a fundamental problem that aims to …
Efficiently answering reachability and path queries on temporal bipartite graphs
Bipartite graphs are naturally used to model relationships between two different types of
entities, such as people-location, authorpaper, and customer-product. When modeling real …
entities, such as people-location, authorpaper, and customer-product. When modeling real …
Accelerated butterfly counting with vertex priority on bipartite graphs
Bipartite graphs are of great importance in many real-world applications. Butterfly, which is a
complete 2× 2 biclique, plays a key role in bipartite graphs. In this paper, we investigate the …
complete 2× 2 biclique, plays a key role in bipartite graphs. In this paper, we investigate the …
Distributed (α, β)-core decomposition over bipartite graphs
(α, β)-core is an important cohesive subgraph model for bipartite graphs. Given a bipartite
graph G, the problem of (α, β)-core decomposition is to compute non-empty (α, β)-cores for …
graph G, the problem of (α, β)-core decomposition is to compute non-empty (α, β)-cores for …
Pareto-optimal community search on large bipartite graphs
In many real-world applications, bipartite graphs are naturally used to model relationships
between two types of entities. Community discovery over bipartite graphs is a fundamental …
between two types of entities. Community discovery over bipartite graphs is a fundamental …
Cohesive subgraph discovery over uncertain bipartite graphs
In this article, we propose the-core model, which is the first cohesive subgraph model on
uncertain bipartite graphs. To capture the uncertainty of relationships/edges,-degree is …
uncertain bipartite graphs. To capture the uncertainty of relationships/edges,-degree is …
Experimental analysis and evaluation of cohesive subgraph discovery
Retrieving cohesive subgraphs in networks is a fundamental problem in social network
analysis and graph data management. These subgraphs can be used for marketing …
analysis and graph data management. These subgraphs can be used for marketing …