pith. sign in

arxiv: 2401.12895 · v2 · submitted 2024-01-23 · 💻 cs.SI · cs.GR

Skyline Community Search over Edge-Attributed Bipartite Graphs

Fangda Guo , Xuanpu Luo , Shiyuan Xu , Haowen Gao , Yanghao Liu , Huawei Shen , Xueqi Cheng This is my paper

Pith reviewed 2026-05-24 04:21 UTC · model grok-4.3

classification 💻 cs.SI cs.GR
keywords community searchbipartite graphsskyline queryedge attributesstructural cohesivenesspeeling algorithmexpanding algorithm
0
0 comments X

The pith

Edge-attributed skyline communities preserve structural cohesiveness while capturing dominance across multiple edge attributes in bipartite graphs.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper defines a new community model for bipartite graphs called the edge-attributed skyline community. This model requires a subgraph to satisfy structural cohesiveness conditions while ensuring that its connecting edges form a skyline set, so that no edge is worse than another across all attribute dimensions. The authors supply a peeling algorithm that repeatedly removes the weakest edges by attribute value and an expanding algorithm that prunes vertices with a proven upper bound. Experiments on real datasets indicate that these procedures run efficiently at scale and return communities with higher precision and diversity than earlier methods that ignored multi-dimensional edge attributes.

Core claim

The central claim is that edge-attributed skyline communities, defined as structurally cohesive subgraphs whose edges are mutually non-dominated under multiple attributes, provide a more complete representation of communities in bipartite graphs than models that consider only structure or single-attribute importance.

What carries the argument

The edge-attributed skyline community (ESC), a subgraph that meets cohesiveness criteria and whose edges form a skyline set with respect to multi-dimensional attributes.

If this is right

  • ESC communities exhibit improved precision and diversity compared with prior community models in case studies.
  • The peeling algorithm computes ESCs by iteratively deleting edges that carry the minimum attribute value in each dimension.
  • The expanding algorithm prunes unpromising vertices early by applying a proven upper bound on their potential contribution.
  • Both algorithms scale to large real-world bipartite graphs while preserving the skyline property.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The ESC definition could be adapted to temporal bipartite graphs by treating time as an additional attribute dimension.
  • Recommendation or fraud-detection pipelines that already use bipartite graphs might substitute ESC communities for ordinary k-core communities to increase result variety.
  • Testing whether the same skyline-plus-cohesiveness combination improves community quality on non-bipartite graphs would clarify the model's scope.

Load-bearing premise

Combining standard structural cohesiveness with skyline dominance on multi-dimensional edge attributes produces communities that are meaningfully superior for downstream tasks.

What would settle it

A direct comparison on a labeled bipartite graph dataset in which ESC communities are evaluated against baseline communities on a concrete task such as recommendation precision or cluster purity; if the measured gains in precision and diversity disappear, the model claim is falsified.

Figures

Figures reproduced from arXiv: 2401.12895 by Fangda Guo, Haowen Gao, Huawei Shen, Shiyuan Xu, Xuanpu Luo, Xueqi Cheng, Yanghao Liu.

Figure 1
Figure 1. Figure 1: Example of communities containing the query. [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: An example of peeling in case d = 2. Example 2: Referring to [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: An example of expanding in case d = 2. At this juncture, S contains the optimally identified ESC (as specified in lines 12-15). In instances where S is capable of dominating some of the ESCs within R, those communities are accordingly removed from R. Conversely, if S is empty, two scenarios emerge : one where f1 is -1, signifying the non￾formation of the initial ESC and necessitating the continuous additio… view at source ↗
Figure 4
Figure 4. Figure 4: Recursive decomposition approach. each solution space. This process iterates until all ESCs are identified (lines 18-22). Algorithm 8: ExpandingDim3 Input: G, α, β, q, F Output: R 1 G∗ ← ∅; R ← ∅; Q ← ∅; P ← ∅; 2 fmax 3 ← ExpandingDim1(G, α, β, q, 3); 3 Q ← Q ∪ (0, 0, fmax 3 ); 4 while Q is not empty do 5 f3 ← the max value of dim=3 in Q; S ← ∅; 6 foreach (p1, p2, f3) in Q do 7 G∗ ← ∅; 8 add edge e with {x… view at source ↗
Figure 6
Figure 6. Figure 6: The efficiency of the algorithms as dimensions changes. [PITH_FULL_IMAGE:figures/full_fig_p011_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: The effectiveness of the algorithms as α changes. 0.2 0.4 0.6 0.8 1.0 10 1 10 0 10 1 Time(s) Crime arXiv DBpedia BookCrossing IMDB TV Tropes (a) d = 1 0.2 0.4 0.6 0.8 1.0 10 2 10 0 10 3 Time(s) Crime arXiv DBpedia BookCrossing IMDB TV Tropes (b) d = 2 0.2 0.4 0.6 0.8 1.0 10 1 10 1 10 4 Time(s) Crime arXiv DBpedia BookCrossing IMDB TV Tropes (c) d = 3 0.2 0.4 0.6 0.8 1.0 10 1 10 2 10 5 Time(s) Crime arXiv D… view at source ↗
Figure 8
Figure 8. Figure 8: Scalability test for different dimensions. [PITH_FULL_IMAGE:figures/full_fig_p011_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Toy example in IMDB. we focus on the performance of single dimension (where d=1) and query for Dwayne Johnson with parameters α=2 and β=2, both the algorithm proposed by [30] and our algorithm yield consistent results, as shown in Fig.10(a). This consistency validates the accuracy of our algorithm. When we take into account the two-dimensional attribute values, setting α=2 and β=3, the communities identifi… view at source ↗
Figure 10
Figure 10. Figure 10: Comparison with different models. dimension alone are shown in Fig.10(c). The ESCs found by our algorithm are displayed in [PITH_FULL_IMAGE:figures/full_fig_p012_10.png] view at source ↗
read the original abstract

Bipartite graphs, modeling relationships between two types of entities, are widely used in practical applications. Community search, a fundamental problem in bipartite graphs, has gained significant attention. However, existing studies focus on measuring structural cohesiveness between vertex sets while either ignoring edge attributes or considering only one-dimensional importance. In this paper, we introduce a novel community model, named edge-attributed skyline community (ESC), which preserves structural cohesiveness and captures the inherent dominance of multi-dimensional edge attributes in bipartite graphs. To search for ESCs, we developed an efficient peeling algorithm that iteratively deletes edges with the minimum attribute in each dimension. Additionally, we devised an expanding algorithm to reduce the search space and speed up the filtering of unpromising vertices using a proven upper bound. Extensive experiments on large-scale real-world datasets demonstrate the efficiency, effectiveness, and scalability of our approach. A case study compared with prior arts demonstrates that our design improves the precision and diversity of results.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 0 minor

Summary. The paper introduces the edge-attributed skyline community (ESC) model for bipartite graphs that combines structural cohesiveness (k-core style) with skyline dominance over multi-dimensional edge attributes. It presents a peeling algorithm that iteratively deletes minimum-attribute edges per dimension and an expanding algorithm that prunes via a proven upper bound. Experiments on large real-world datasets report efficiency and scalability; a case study asserts that ESC yields higher precision and diversity than prior community search methods.

Significance. If the algorithmic correctness and experimental claims hold, the work extends community search to attributed bipartite graphs, addressing a gap where prior methods either ignore edge attributes or handle only single dimensions. The peeling and expanding techniques, together with the skyline integration, could be reusable in other multi-attribute graph mining settings. The reported scalability on real datasets is a concrete strength.

major comments (2)
  1. [Case Study] Case Study section: the assertion that ESC 'improves the precision and diversity of results' compared with prior arts is load-bearing for the central contribution, yet the manuscript supplies neither an explicit, reproducible definition of precision (e.g., overlap with labeled communities or a downstream task) nor a quantitative diversity metric whose improvement is shown to exceed the effect of the skyline filter alone.
  2. [Experiments] Experiments section: while runtime and scalability results are presented, the effectiveness evaluation reduces to the same case study; without defined ground truth or metrics, the superiority claim cannot be verified and therefore weakens the overall evaluation of the ESC model.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive feedback on our manuscript. The comments highlight important aspects of how the case study and effectiveness claims are presented. We address each point below and indicate planned revisions to strengthen the evaluation.

read point-by-point responses

  1. Referee: [Case Study] Case Study section: the assertion that ESC 'improves the precision and diversity of results' compared with prior arts is load-bearing for the central contribution, yet the manuscript supplies neither an explicit, reproducible definition of precision (e.g., overlap with labeled communities or a downstream task) nor a quantitative diversity metric whose improvement is shown to exceed the effect of the skyline filter alone.

    Authors: We agree that the current presentation of the case study would be strengthened by explicit, reproducible definitions. In the revised manuscript we will add a dedicated paragraph defining precision as the fraction of community vertices that match a manually curated set of relevant entities (derived from domain inspection of the case-study dataset) and diversity as the mean pairwise Euclidean distance across the multi-dimensional edge-attribute vectors within the community. We will also include an ablation that isolates the skyline component by comparing ESC against a non-skyline k-core baseline on the same data, thereby quantifying the incremental benefit. These additions will make the claims verifiable without altering the underlying experimental results. revision: yes

  2. Referee: [Experiments] Experiments section: while runtime and scalability results are presented, the effectiveness evaluation reduces to the same case study; without defined ground truth or metrics, the superiority claim cannot be verified and therefore weakens the overall evaluation of the ESC model.

    Authors: We acknowledge that the effectiveness evaluation currently rests on the single case study. To mitigate this, the revised experiments section will incorporate additional quantitative checks on synthetic bipartite graphs with planted communities (where ground-truth membership is known), reporting precision and diversity under controlled attribute distributions. For the real-world datasets that lack external labels, the case study will remain as an illustrative demonstration of practical utility; we will explicitly note this limitation. This hybrid approach addresses the verification concern while respecting the nature of the data. revision: partial

Circularity Check

0 steps flagged

No circularity: model and algorithms defined independently without reduction to inputs

full rationale

The paper introduces ESC as a direct definition combining k-core-style structural cohesiveness with skyline dominance over multi-dimensional edge attributes. The peeling algorithm is specified as iteratively deleting minimum-attribute edges per dimension, and the expanding algorithm uses a separately proven upper bound to prune vertices; neither step references fitted parameters, prior self-citations as load-bearing premises, or renames existing results. Experiments and the case study are presented as external validation rather than part of any derivation chain. No equation or claim reduces to its own inputs by construction, satisfying the self-contained criterion.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The paper introduces a new definitional model and algorithmic procedures; it does not rely on fitted numerical parameters, unproven mathematical axioms beyond standard graph theory, or new physical entities.

axioms (2)
  • domain assumption Bipartite graphs are a standard model for relationships between two entity types
    Invoked in the opening sentence of the abstract as the modeling foundation.
  • domain assumption Structural cohesiveness can be measured by established metrics such as core numbers or similar density measures
    Implicit in the statement that ESC 'preserves structural cohesiveness' while adding attribute dominance.
invented entities (1)
  • edge-attributed skyline community (ESC) no independent evidence
    purpose: A new community definition that adds skyline dominance over multi-dimensional edge attributes to structural cohesiveness
    Introduced as the central novel model in the abstract; no independent falsifiable evidence outside the definition itself is supplied.

pith-pipeline@v0.9.0 · 5710 in / 1427 out tokens · 24307 ms · 2026-05-24T04:21:09.727633+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

56 extracted references · 56 canonical work pages · 1 internal anchor

  1. [1]

    Local search of communities in large graphs,

    W. Cui, Y . Xiao, H. Wang, and W. Wang, “Local search of communities in large graphs,” in SIGMOD, 2014, pp. 991–1002

    work page 2014

  2. [2]

    Influential community search in large networks,

    R. Li, L. Qin, J. X. Yu, and R. Mao, “Influential community search in large networks,” PVLDB, vol. 8, no. 5, pp. 509–520, 2015

    work page 2015

  3. [3]

    Effective community search over large spatial graphs

    Y . Fang, R. Cheng, X. Li, S. Luo, and J. Hu, “Effective community search over large spatial graphs.” PVLDB, vol. 10, no. 6, pp. 709–720, 2017

    work page 2017

  4. [4]

    Effective and efficient attributed community search,

    Y . Fang, R. Cheng, Y . Chen, S. Luo, and J. Hu, “Effective and efficient attributed community search,” VLDB Journal, vol. 26, no. 6, pp. 803– 828, 2017

    work page 2017

  5. [5]

    Attribute-driven community search,

    X. Huang and L. V . Lakshmanan, “Attribute-driven community search,” PVLDB, vol. 10, no. 9, pp. 949–960, 2017

    work page 2017

  6. [6]

    Skyline community search in multi-valued networks,

    R. Li, L. Qin, F. Ye, J. X. Yu, X. Xiao, N. Xiao, and Z. Zheng, “Skyline community search in multi-valued networks,” in SIGMOD, 2018, pp. 457–472

    work page 2018

  7. [7]

    Contextual community search over large social networks,

    L. Chen, C. Liu, K. Liao, J. Li, and R. Zhou, “Contextual community search over large social networks,” in ICDE, 2019, pp. 88–99

    work page 2019

  8. [8]

    Efficient attribute-constrained co-located community search,

    J. Luo, X. Cao, X. Xie, Q. Qu, Z. Xu, and C. S. Jensen, “Efficient attribute-constrained co-located community search,” in ICDE, 2020, pp. 1201–1212

    work page 2020

  9. [9]

    Vac: vertex- centric attributed community search,

    Q. Liu, Y . Zhu, M. Zhao, X. Huang, J. Xu, and Y . Gao, “Vac: vertex- centric attributed community search,” in ICDE, 2020, pp. 937–948

    work page 2020

  10. [10]

    Multi-attributed com- munity search in road-social networks,

    F. Guo, Y . Yuan, G. Wang, X. Zhao, and H. Sun, “Multi-attributed com- munity search in road-social networks,” in 2021 IEEE 37th International Conference on Data Engineering (ICDE) . IEEE, 2021, pp. 109–120

    work page 2021

  11. [11]

    The dblp computer science bibliography: Evolution, research issues, perspectives,

    M. Ley, “The dblp computer science bibliography: Evolution, research issues, perspectives,” in International symposium on string processing and information retrieval , 2002, pp. 1–10

    work page 2002

  12. [12]

    Unifying user-based and item-based collaborative filtering approaches by similarity fusion,

    J. Wang, A. P. De Vries, and M. J. Reinders, “Unifying user-based and item-based collaborative filtering approaches by similarity fusion,” in SIGIR, 2006, pp. 501–508

    work page 2006

  13. [13]

    Efficiently answering reachability and path queries on temporal bipartite graphs,

    X. Chen, K. Wang, X. Lin, W. Zhang, L. Qin, and Y . Zhang, “Efficiently answering reachability and path queries on temporal bipartite graphs,” PVLDB, vol. 14, no. 10, p. 1845–1858, 2021

    work page 2021

  14. [14]

    Efficient fault-tolerant group recommendation using alpha-beta-core,

    D. Ding, H. Li, Z. Huang, and N. Mamoulis, “Efficient fault-tolerant group recommendation using alpha-beta-core,” in CIKM, 2017, pp. 2047–2050

    work page 2017

  15. [15]

    Efficient (α, β)-core computation: An index-based approach,

    B. Liu, L. Yuan, X. Lin, L. Qin, W. Zhang, and J. Zhou, “Efficient (α, β)-core computation: An index-based approach,” in WWW, 2019, pp. 1130–1141

    work page 2019

  16. [16]

    Efficient ( α, β)-core computation in bipartite graphs,

    B. Liu, L. Yuan, X. Lin, L. Qin, and J. Zhou, “Efficient ( α, β)-core computation in bipartite graphs,” The VLDB Journal , vol. 29, no. 3, 2020

    work page 2020

  17. [17]

    Bitruss decomposition of bipartite graphs,

    Z. Zou, “Bitruss decomposition of bipartite graphs,” in DASFAA, 2016, pp. 218–233

    work page 2016

  18. [18]

    Peeling bipartite networks for dense subgraph discovery,

    A. E. Sarıy ¨uce and A. Pinar, “Peeling bipartite networks for dense subgraph discovery,” in WSDM, 2018, pp. 504–512

    work page 2018

  19. [19]

    Efficient bitruss decomposition for large-scale bipartite graphs,

    K. Wang, X. Lin, L. Qin, W. Zhang, and Y . Zhang, “Efficient bitruss decomposition for large-scale bipartite graphs,” in ICDE, 2020, pp. 661– 672

    work page 2020

  20. [20]

    On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types,

    Y . Zhang, C. A. Phillips, G. L. Rogers, E. J. Baker, E. J. Chesler, and M. A. Langston, “On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types,” BMC bioinformatics, vol. 15, pp. 1–18, 2014

    work page 2014

  21. [21]

    Maximum biclique search at billion scale,

    B. Lyu, L. Qin, X. Lin, Y . Zhang, Z. Qian, and J. Zhou, “Maximum biclique search at billion scale,” PVLDB, vol. 13, no. 9, p. 1359–1372, 2020

    work page 2020

  22. [22]

    Efficient personalized maximum biclique search,

    K. Wang, W. Zhang, X. Lin, L. Qin, and A. Zhou, “Efficient personalized maximum biclique search,” in ICDE, 2022, pp. 498–511

    work page 2022

  23. [23]

    Efficient and effective community search on large-scale bipartite graphs,

    K. Wang, W. Zhang, X. Lin, Y . Zhang, L. Qin, and Y . Zhang, “Efficient and effective community search on large-scale bipartite graphs,” in 2021 IEEE 37th International Conference on Data Engineering (ICDE) . IEEE, 2021, pp. 85–96

    work page 2021

  24. [24]

    Pareto-optimal community search on large bipartite graphs,

    Y . Zhang, K. Wang, W. Zhang, X. Lin, and Y . Zhang, “Pareto-optimal community search on large bipartite graphs,” pp. 2647–2656, 2021

    work page 2021

  25. [25]

    Discovering significant communities on bipartite graphs: An index-based approach,

    K. Wang, W. Zhang, Y . Zhang, L. Qin, and Y . Zhang, “Discovering significant communities on bipartite graphs: An index-based approach,” TKDE, vol. 35, no. 3, pp. 2471–2485, 2023

    work page 2023

  26. [26]

    Dbpedia: A nucleus for a web of open data,

    S. Auer, C. Bizer, G. Kobilarov, J. Lehmann, R. Cyganiak, and Z. Ives, “Dbpedia: A nucleus for a web of open data,” in international semantic web conference. Springer, 2007, pp. 722–735

    work page 2007

  27. [27]

    Improving recommendation lists through topic diversification,

    C. N. Ziegler, S. M. Mcnee, J. A. Konstan, and G. Lausen, “Improving recommendation lists through topic diversification,” in The Web Confer- ence, 2005

    work page 2005

  28. [28]

    Learning word vectors for sentiment analysis,

    A. L. Maas, R. E. Daly, P. T. Pham, D. Huang, A. Y . Ng, and C. Potts, “Learning word vectors for sentiment analysis,” in Annual meeting of the Association for Computational Linguistics , 2011

    work page 2011

  29. [29]

    The structure of scientific collaboration networks,

    M. E. Newman, “The structure of scientific collaboration networks,” Proceedings of the national academy of sciences , vol. 98, no. 2, pp. 404–409, 2001

    work page 2001

  30. [30]

    K-core decom- position of large networks on a single pc,

    W. Khaouid, M. Barsky, V . Srinivasan, and A. Thomo, “K-core decom- position of large networks on a single pc,” PVLDB, vol. 9, no. 1, pp. 13–23, 2015

    work page 2015

  31. [31]

    Distributed ( α, β)-core decomposition over bipartite graphs,

    Q. Liu, X. Liao, X. Huang, J. Xu, and Y . Gao, “Distributed ( α, β)-core decomposition over bipartite graphs,” in 2023 IEEE 39th International Conference on Data Engineering (ICDE) . IEEE, 2023, pp. 909–921

    work page 2023

  32. [32]

    Local search of communities in large graphs,

    W. Cui, Y . Xiao, H. Wang, J. Hong, and W. Wang, “Local search of communities in large graphs,” ACM, 2014

    work page 2014

  33. [33]

    A survey of community search over big graphs,

    Y . Fang, X. Huang, L. Qin, Y . Zhang, W. Zhang, R. Cheng, and X. Lin, “A survey of community search over big graphs,”Springer Berlin Heidelberg, 2020

    work page 2020

  34. [34]

    Effective and efficient community search over large heterogeneous information networks,

    Y . Fang, Y . Yang, W. Zhang, X. Lin, and X. Cao, “Effective and efficient community search over large heterogeneous information networks,” Proceedings of the VLDB Endowment, vol. 13, no. 6, pp. 854–867, 2020

    work page 2020

  35. [35]

    An o(m) algorithm for cores decomposition of networks

    V . Batagelj and M. Zaversnik, “An o(m) algorithm for cores decompo- sition of networks,” CoRR, cs.DS/0310049, 2003

    work page arXiv 2003

  36. [36]

    Distance-generalized core de- composition,

    F. Bonchi, A. Khan, and L. Severini, “Distance-generalized core de- composition,” in proceedings of the 2019 international conference on management of data , 2019, pp. 1006–1023

    work page 2019

  37. [37]

    Trusses: Cohesive subgraphs for social network analysis,

    J. Cohen, “Trusses: Cohesive subgraphs for social network analysis,” National security agency technical report , vol. 16, no. 3.1, pp. 1–29, 2008

    work page 2008

  38. [38]

    Unboundedness and efficiency of truss main- tenance in evolving graphs,

    Y . Zhang and J. X. Yu, “Unboundedness and efficiency of truss main- tenance in evolving graphs,” in Proceedings of the 2019 International Conference on Management of Data , 2019, pp. 1024–1041

    work page 2019

  39. [39]

    The community-search problem and how to plan a successful cocktail party,

    M. Sozio and A. Gionis, “The community-search problem and how to plan a successful cocktail party,” in SIGKDD, 2010, pp. 939–948

    work page 2010

  40. [40]

    An Optimal and Progressive Approach to Online Search of Top-k Influential Communities

    F. Bi, L. Chang, X. Lin, and W. Zhang, “An optimal and progressive approach to online search of top-k influential communities,” arXiv preprint arXiv:1711.05857, 2017

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  41. [41]

    Efficient computation of importance based communities in web-scale networks using a single machine,

    S. Chen, R. Wei, D. Popova, and A. Thomo, “Efficient computation of importance based communities in web-scale networks using a single machine,” in Proceedings of the 25th ACM International on Conference on Information and Knowledge Management , 2016, pp. 1553–1562

    work page 2016

  42. [42]

    Persistent community search in temporal networks,

    R.-H. Li, J. Su, L. Qin, J. X. Yu, and Q. Dai, “Persistent community search in temporal networks,” in 2018 IEEE 34th International Confer- ence on Data Engineering (ICDE) . IEEE, 2018, pp. 797–808

    work page 2018

  43. [43]

    Skyline community search in multi-valued networks,

    R. H. Li, L. Qin, F. Ye, J. X. Yu, and Z. Zheng, “Skyline community search in multi-valued networks,” in the 2018 International Conference, 2018

    work page 2018

  44. [44]

    Exploring communities in large profiled graphs,

    Y . Chen, Y . Fang, R. Cheng, Y . Li, X. Chen, and J. Zhang, “Exploring communities in large profiled graphs,”IEEE Transactions on Knowledge and Data Engineering , vol. 31, no. 8, pp. 1624–1629, 2018

    work page 2018

  45. [45]

    Attribute-driven community search,

    X. Huang and L. V . S. Lakshmanan, “Attribute-driven community search,” in Very Large Data Bases , 2017

    work page 2017

  46. [46]

    Finding weighted k-truss communities in large networks,

    Z. Zheng, F. Ye, R. H. Li, G. Ling, and T. Jin, “Finding weighted k-truss communities in large networks,” Information ences, vol. 417, 2017

    work page 2017

  47. [47]

    On social-temporal group query with acquaintance constraint,

    D. N. Yang, M. S. Chen, W. C. Lee, and Y . L. Chen, “On social-temporal group query with acquaintance constraint,” 2011

    work page 2011

  48. [48]

    Most influential community search over large social networks,

    J. Li, X. Wang, K. Deng, X. Yang, and J. X. Yu, “Most influential community search over large social networks,” in 2017 IEEE 33rd International Conference on Data Engineering (ICDE) , 2017

    work page 2017

  49. [49]

    Cliques, clubs and clans,

    R. J. Mokken, “Cliques, clubs and clans,” Quality & Quantity , vol. 13, no. 2, pp. 161–173, 1979

    work page 1979

  50. [50]

    A graph-theoretic generalization of the clique concept*,

    S. B. Seidman and B. L. Foster, “A graph-theoretic generalization of the clique concept*,” Journal of Mathematical Sociology , vol. 6, no. 1, pp. 139–154, 1978

    work page 1978

  51. [51]

    Effective community search for large attributed graphs,

    Y . Fang, R. Cheng, S. Luo, and J. Hu, “Effective community search for large attributed graphs,” PVLDB, vol. 9, no. 12, pp. 1233–1244, 2016

    work page 2016

  52. [52]

    Effective community search over large spatial graphs,

    Y . Fang, C. Cheng, S. Luo, J. Hu, and X. Li, “Effective community search over large spatial graphs,” Proceedings of the VLDB Endowment (PVLDB), 2017

    work page 2017

  53. [53]

    On spatial-aware community search,

    Y . Fang, Z. Wang, R. Cheng, X. Li, S. Luo, J. Hu, and X. Chen, “On spatial-aware community search,” IEEE Transactions on Knowledge and Data Engineering, vol. 31, no. 4, pp. 783–798, 2018

    work page 2018

  54. [54]

    Finding influential communities in massive networks,

    R.-H. Li, L. Qin, J. X. Yu, and R. Mao, “Finding influential communities in massive networks,” The VLDB Journal , vol. 26, pp. 751–776, 2017

    work page 2017

  55. [55]

    Significant- attributed community search in heterogeneous information networks,

    Y . Liu, F. Guo, B. Xu, P. Bao, H. Shen, and X. Cheng, “Significant- attributed community search in heterogeneous information networks,” arXiv preprint arXiv:2308.13244 , 2023

    work page arXiv 2023

  56. [56]

    Pareto-optimal community search on large bipartite graphs,

    Y . Zhang, K. Wang, W. Zhang, X. Lin, and Y . Zhang, “Pareto-optimal community search on large bipartite graphs,” in Proceedings of the 30th ACM International Conference on Information & Knowledge Management, 2021, pp. 2647–2656

    work page 2021