Author:
Alexe Gabriela,Alexe Sorin,Crama Yves,Foldes Stephan,Hammer Peter L.,Simeone Bruno
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
110 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Identifying similar-bicliques in bipartite graphs;The VLDB Journal;2024-01-25
2. Efficient Maximal Biclique Enumeration on GPUs;Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis;2023-11-11
3. FPGN: follower prediction framework for infectious disease prevention;World Wide Web;2023-09-16
4. Group-based Fraud Detection Network on e-Commerce Platforms;Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2023-08-04
5. Identifying similar-bicliques in bipartite graphs;Proceedings of the VLDB Endowment;2022-07