Short cycle connectivity-Reference-Cited by-同舟云学术

Short cycle connectivity

Published:2007-02 Issue:3-5 Volume:307 Page:310-318
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Batagelj V.,Zaveršnik M.

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference14 articles.

1. A subquadratic triad census algorithm for large sparse networks with small maximum degree;Batagelj;Social Networks,2001

2. Pajek—analysis and visualization of large networks;Batagelj,2003

3. R. Diestel, Graph theory, second ed., Graduate Texts in Mathematics, vol. 173, Springer, New York, 2000 〈http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/〉.

4. Symmetric-acyclic decompositions of networks;Doreian;J. Classification,2000

5. Curvature of co-links uncovers hidden thematic layers in the World Wide Web;Eckmann;Proc. Nat. Acad. Sci.,2002

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

1. Size-Constrained Community Search on Large Networks: An Effective and Efficient Solution;IEEE Transactions on Knowledge and Data Engineering;2024-01

2. Structured encryption for triangle counting on graph data;Future Generation Computer Systems;2023-08

3. Four node graphlet and triad enumeration on distributed platforms;Distributed and Parallel Databases;2022-07-30

4. Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream;ACM Transactions on Knowledge Discovery from Data;2022-01-08

5. BSR-TC: Adaptively Sampling for Accurate Triangle Counting over Evolving Graph Streams;International Journal of Software Engineering and Knowledge Engineering;2021-12