Subgraph enumeration in optimal I/O complexity
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3910446 (Why is no real title available?)
- scientific article; zbMATH DE number 1131873 (Why is no real title available?)
- scientific article; zbMATH DE number 7566062 (Why is no real title available?)
- scientific article; zbMATH DE number 7650999 (Why is no real title available?)
- scientific article; zbMATH DE number 7651003 (Why is no real title available?)
- scientific article; zbMATH DE number 7788476 (Why is no real title available?)
- A general purpose algorithm for counting simple cycles and simple paths of any length
- Arboricity and Subgraph Listing Algorithms
- Arboricity and bipartite subgraph listing algorithms
- Color-coding
- Counting thin subgraphs via packings faster than meet-in-the-middle time
- Detecting and counting small pattern graphs
- Enumerating subgraphs of constant sizes in external memory
- Faster algorithms for finding and counting subgraphs
- Finding and counting given length cycles
- Finding and counting small induced subgraphs efficiently
- Finding and listing induced paths and cycles
- Finding, minimizing, and counting weighted subgraphs
- Homomorphisms are a good basis for counting small subgraphs
- I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration
- It's all a matter of degree. Using degree information to optimize multiway joins
- Joins via geometric resolutions. Worst case and beyond
- Listing all maximal cliques in sparse graphs in near-optimal time
- Listing triangles
- Subgraph Isomorphism in Planar Graphs and Related Problems
- The complexity of theorem-proving procedures
- Worst-case optimal join algorithms
This page was built for publication: Subgraph enumeration in optimal I/O complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902066)
