Recommendations
Cites work
- scientific article; zbMATH DE number 3910446 (Why is no real title available?)
- scientific article; zbMATH DE number 3974318 (Why is no real title available?)
- scientific article; zbMATH DE number 910922 (Why is no real title available?)
- Arboricity and Subgraph Listing Algorithms
- Color-coding
- Cycles of even length in graphs
- Finding Even Cycles Even Faster
- Finding a Minimum Circuit in a Graph
- Finding and counting given length cycles
- Finding and counting small induced subgraphs efficiently
- Finding short cycles in planar graphs using separators
- On generalized graphs
- Recognizing small subgraphs
- Smallest-last ordering and clustering and graph coloring algorithms
Cited in
(only showing first 100 items - show all)- Finding and counting small tournaments in large tournaments
- Balanced hashing, color coding and approximate counting
- Immersed cycles and the JSJ decomposition
- Answering conjunctive queries with inequalities
- Coverability in VASS revisited: improving Rackoff's bounds to obtain conditional optimality
- Triangle edge deletion on planar glasses-free RGB-digraphs
- The challenges of unbounded treewidth in parameterised subgraph counting problems
- Removing additive structure in 3SUM-based reductions
- Stronger 3-SUM lower bounds for approximate distance oracles via additive combinatorics
- Local graph stability in exponential family random graph models
- On generating triangle-free graphs
- A dichotomy theorem for linear time homomorphism orbit counting in bounded degeneracy graphs
- A task-scheduling approach for efficient sparse symmetric matrix-vector multiplication on a GPU
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
- Subgraph enumeration in optimal I/O complexity
- Evaluating Datalog via tree automata and cycluits
- Sparse matrix multiplication and triangle listing in the congested clique model
- From circuit complexity to faster all-pairs shortest paths
- A VLSI circuit model accounting for wire delay
- Integral regular net-balanced signed graphs with vertex degree at most four
- Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP
- Complexity of counting cycles using zeons
- Maximum cardinality neighbourly sets in quadrilateral free graphs
- Counting subgraphs in relational event graphs
- Counting Subgraphs in Degenerate Graphs
- scientific article; zbMATH DE number 3937199 (Why is no real title available?)
- On cube-free median graphs
- Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract)
- Color-coding
- Are unique subgraphs not easier to find?
- A Hopf algebra for counting cycles
- Sublinear-time algorithms for counting star subgraphs via edge sampling
- Parity check matrices and product representations of squares
- Lazy or eager dynamic matching may not be fast
- The fine-grained complexity of multi-dimensional ordering properties
- The many facets of the Estrada indices of graphs and networks
- On the expressive power of linear algebra on graphs
- Fast Output-Sensitive Matrix Multiplication
- On triangle estimation using tripartite independent set queries
- Improved distance queries and cycle counting by Frobenius normal form
- Finding a long directed cycle
- Listing 4-cycles
- On the expressive power of linear algebra on graphs
- 3SUM, 3XOR, triangles
- scientific article; zbMATH DE number 7049740 (Why is no real title available?)
- FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams
- On the characteristic polynomial of the power of a path
- scientific article; zbMATH DE number 7053319 (Why is no real title available?)
- Counting Triangles under Updates in Worst-Case Optimal Time
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
- Counting simplices in hypergraph streams
- Finding and counting given length cycles
- Efficient algorithms for clique problems
- On the Hasse diagram of binary linear codes
- Parameterized graph separation problems
- On claw-free asteroidal triple-free graphs
- Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
- \textsf{PANDA}: query evaluation in submodular width
- Detecting short directed cycles using rectangular matrix multiplication and dynamic programming
- Unique subgraphs are not easier to find
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Efficient approximation algorithms for shortest cycles in undirected graphs
- Complex networks: structure and dynamics
- On the complexity of fixed parameter clique and dominating set
- _i-metric graphs: radius, diameter and all eccentricities
- Two-walks degree assortativity in graphs and networks
- Counting Homomorphic Cycles in Degenerate Graphs
- Graph classes and forbidden patterns on three vertices
- Approximately counting triangles in sublinear time
- Faster all-pairs shortest paths via circuit complexity
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments
- Triangle‐free equimatchable graphs
- Enumerating simple paths from connected induced subgraphs
- Treewidth for graphs with small chordality
- Finding and counting small induced subgraphs efficiently
- Computing the rooted triplet distance between galled trees by counting triangles
- scientific article; zbMATH DE number 7765381 (Why is no real title available?)
- New bounds for the number of lightest cycles in undirected graphs
- Triangles and girth in disk graphs and transmission graphs
- Getting linear time in graphs of bounded neighborhood diversity
- Extended dynamic subgraph statistics using h-index parameterized data structures
- Complexity issues for the sandwich homogeneous set problem
- An efficient algorithm for counting cycles in QC and APM LDPC codes
- Testing for Equivalence of Network Distribution Using Subgraph Counts
- Find subtrees of specified weight and cycles of specified length in linear time
- An efficient algorithm for Helly property recognition in a linear hypergraph
- Optimal listing of cycles and st-paths in undirected graphs
- Recognizing graphs without asteroidal triples
- The possible number of cycles in cycle systems
- QPTAS and subexponential algorithm for maximum clique on disk graphs
- Tensor network complexity of multilinear maps
- Parameterized coloring problems on chordal graphs
- Time windowed data structures for graphs
- On the combinatorial power of the Weisfeiler-Lehman algorithm
- Lengths of words accepted by nondeterministic finite automata
- Arboricity, \(h\)-index, and dynamic algorithms
- Finding and counting patterns in sparse graphs
- Any-k algorithms for enumerating ranked answers to conjunctive queries
- The strongish planted clique hypothesis and its consequences
This page was built for publication: Finding and counting given length cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675293)
