Join and subgraph sampling under degree constraints
From MaRDI portal
Cites work
- A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
- An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar Graph
- Applications of information inequalities to database theory problems
- Arboricity and Subgraph Listing Algorithms
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Degree sequence bound for join cardinality estimation
- Finding and listing induced paths and cycles
- scientific article; zbMATH DE number 3910446 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 7650999 (Why is no real title available?)
- It's all a matter of degree. Using degree information to optimize multiway joins
- Listing all fixed-length simple cycles in sparse graphs in optimal time
- Listing triangles
- On the number of subgraphs of prescribed type of graphs with a given number of edges
- Parameterized aspects of triangle enumeration
- Random Sampling and Size Estimation Over Cyclic Joins.
- Removing additive structure in 3SUM-based reductions
- Sampling arbitrary subgraphs exactly uniformly in sublinear time
- Size bounds and query plans for relational joins
- Subgraph Isomorphism in Planar Graphs and Related Problems
- Understanding and using linear programming
- Worst-case optimal join algorithms
This page was built for publication: Join and subgraph sampling under degree constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6924409)
