scientific article; zbMATH DE number 7310089
From MaRDI portal
Publication:5150438
Publication date: 15 February 2021
Full work available at URL: http://mathnet.ru/eng/pdm350
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Finding and counting given length cycles
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
- An algorithm for counting short cycles in bipartite graphs
- The Complexity of Enumeration and Reliability Problems
- Matrix measures for transitivity and balance*
- The Structure and Function of Complex Networks
- The Parameterized Complexity of Counting Problems
This page was built for publication: