Author:
Bourneuf Lucas,Nicolas Jacques
Publisher
Springer International Publishing
Reference27 articles.
1. Agarwal, P.K., Alon, N., Aronov, B., Suri, S.: Can visibility graphs be represented compactly? Discret. Comput. Geom. 12(3), 347–365 (1994)
2. Ahnert, S.E.: Generalised power graph compression reveals dominant relationship patterns in complex networks. Sci. Rep. 4, Article no. 4385 (2014). https://www.nature.com/articles/srep04385
3. Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques. Discret. Appl. Math. 145(1), 11–21 (2004). Graph Optimization IV
4. Amilhastre, J., Vilarem, M., Janssen, P.: Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs. Discret. Appl. Math. 86(2–3), 125–144 (1998)
5. Bu, D., Zhao, Y., Cai, L., Xue, H., Zhu, X., Lu, H., Zhang, J., Sun, S., Ling, L., Zhang, N., Li, G., Chen, R.: Topological structure analysis of the protein–protein interaction network in budding yeast. Nucleic Acids Res. 31(9), 2443–2450 (2003)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献