Author:
Lin Min Chih,Soulignac Francisco J.,Szwarcfiter Jayme L.
Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. Finding and counting given length cycles;Alon;Algorithmica,1997
2. Clique graphs and Helly graphs;Bandelt;J. Combin. Theory Ser. B,1991
3. Extremal Graph Theory;Bollobás,2004
4. Arboricity and subgraph listing algorithms;Chiba;SIAM J. Comput.,1985
5. (K4−e)-free perfect graphs and star cutsets;Conforti,1989
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs;Proceedings of the VLDB Endowment;2024-07
2. Comparability digraphs: An analogue of comparability graphs;Discrete Mathematics;2024-03
3. Incremental Influential Community Detection in Large Networks;34th International Conference on Scientific and Statistical Database Management;2022-07-06
4. Efficient $k-\text{clique}$ Listing with Set Intersection Speedup;2022 IEEE 38th International Conference on Data Engineering (ICDE);2022-05
5. Efficient Top-k Ego-Betweenness Search;2022 IEEE 38th International Conference on Data Engineering (ICDE);2022-05