Efficient algorithms for densest subgraph discovery on large directed graphs
Given a directed graph G, the directed densest subgraph (DDS) problem refers to the finding
of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS …
of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS …
VAC: vertex-centric attributed community search
Attributed community search aims to find the community with strong structure and attribute
cohesiveness from attributed graphs. However, existing works suffer from two major …
cohesiveness from attributed graphs. However, existing works suffer from two major …
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 …
Attribute-sensitive community search over attributed heterogeneous information networks
J Wang, L Zhou, X Wang, L Wang, S Li - Expert Systems with Applications, 2024 - Elsevier
Community search (CS) over attributed heterogeneous information networks (AHINs) takes
both network structure and attributes of nodes into consideration, which can support …
both network structure and attributes of nodes into consideration, which can support …
On directed densest subgraph discovery
Given a directed graph G, the directed densest subgraph (DDS) problem refers to the finding
of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS …
of a subgraph from G, whose density is the highest among all the subgraphs of G. The DDS …
Butterfly-core community search over labeled graphs
Community search aims at finding densely connected subgraphs for query vertices in a
graph. While this task has been studied widely in the literature, most of the existing works …
graph. While this task has been studied widely in the literature, most of the existing works …
Scalable community search over large-scale graphs based on graph transformer
Given a graph G and a query node q, community search (CS) aims to find a structurally
cohesive subgraph from G that contains q. CS is widely used in many real-world …
cohesive subgraph from G that contains q. CS is widely used in many real-world …
Topic-based community search over spatial-social networks
A Al-Baghdadi, X Lian - Proceedings of the VLDB Endowment, 2020 - dl.acm.org
Recently, the community search problem has attracted significant attention, due to its wide
spectrum of real-world applications such as event organization, friend recommendation …
spectrum of real-world applications such as event organization, friend recommendation …
Firmtruss community search in multilayer networks
In applications such as biological, social, and transportation networks, interactions between
objects span multiple aspects. For accurately modeling such applications, multilayer …
objects span multiple aspects. For accurately modeling such applications, multilayer …
Multi-attributed community search in road-social networks
F Guo, Y Yuan, G Wang, X Zhao… - 2021 IEEE 37th …, 2021 - ieeexplore.ieee.org
Given a location-based social network, how to find the communities that are highly relevant
to query users and have top overall scores in multiple attributes according to user …
to query users and have top overall scores in multiple attributes according to user …