An exact algorithm for the maximum k-club problem in an undirected graph-Reference-Cited by-同舟云学术

An exact algorithm for the maximum k-club problem in an undirected graph

Published:2002-04 Issue:1 Volume:138 Page:21-28
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Bourjolly Jean-Marie,Laporte Gilbert,Pesant Gilles

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference14 articles.

1. A graph-theoretic definition of a sociometric clique;Alba;Journal of Mathematical Sociology,1973

2. Taking stock of network analysis: A decade's result;Alba;Research in the Sociology of Organizations,1982

3. Market networks and corporate behavior;Baker;American Journal of Mathematical Sociology,1986

4. Heuristics for finding k-clubs in an undirected graph;Bourjolly;Computers & Operations Research,2000

5. Finding all cliques of an undirected graph;Bron;Communications of the ACM,1973

Cited by 71 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Finding conserved low‐diameter subgraphs in social and biological networks;Networks;2024-08-29

2. On the parameterized complexity of non-hereditary relaxations of clique;Theoretical Computer Science;2024-07

3. Efficient Maximum k-Defective Clique Computation with Improved Time Complexity;Proceedings of the ACM on Management of Data;2023-11-13

4. The Parameterized Complexity of s-Club with Triangle and Seed Constraints;Theory of Computing Systems;2023-08-12

5. On the Tractability of Covering a Graph with 2-Clubs;Algorithmica;2022-11-21