Consensus algorithms for the generation of all maximal bicliques-Reference-Cited by-同舟云学术

Consensus algorithms for the generation of all maximal bicliques

Published:2004-12 Issue:1 Volume:145 Page:11-21
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Alexe Gabriela,Alexe Sorin,Crama Yves,Foldes Stephan,Hammer Peter L.,Simeone Bruno

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference43 articles.

1. P. Agarwal, N. Alon, B. Aronov, S. Suri, Can visibility graphs be represented compactly? in: Proceedings of the Ninth ACM Symposium on Computational Geometry, 1993, pp. 338–347.

2. The Design and Analysis of Computer Algorithms;Aho,1974

3. Adjoints of pure bidirected graphs;Benzaken;Congress. Numer,1983

4. Some remarks on conflict graphs of quadratic pseudo-Boolean functions;Benzaken;Internat. Ser. Numer. Math,1980

5. J.-C. Bermond, Couvertures des arrêtes d'un graphe par des graphes bipartis complets, Preprint, Univ. De Paris Sud, Centre d'Orsay, Rapport de Recherche No. 10, 1978.

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

1. Accelerating Maximal Bicliques Enumeration with GPU on large scale network;Future Generation Computer Systems;2024-12

2. Routing and scheduling of trains and engines in a railway marshalling station yard;Transportation Research Part C: Emerging Technologies;2024-10

3. Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs;Proceedings of the VLDB Endowment;2024-07

4. Maximal Biclique Enumeration: A Prefix Tree Based Approach;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

5. Identifying similar-bicliques in bipartite graphs;The VLDB Journal;2024-01-25