Finding and counting given length cycles
From MaRDI portal
Recommendations
Cites work
- Arboricity and Subgraph Listing Algorithms
- Color-coding
- Cycles of even length in graphs
- Finding a Minimum Circuit in a Graph
- Finding and counting given length cycles
- Finding and counting small induced subgraphs efficiently
- Finding Even Cycles Even Faster
- Finding short cycles in planar graphs using separators
- 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?)
- On generalized graphs
- Recognizing small subgraphs
- Smallest-last ordering and clustering and graph coloring algorithms
Cited in
(only showing first 100 items - show all)- Detecting directed 4-cycles still faster
- A parameterized view on matroid optimization problems
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Algorithms to count paths and cycles
- A nice class for the vertex packing problem
- A method to find elements of cycles in an incomplete directed graph and its applications - binary AHP and Petri nets
- Treewidth for graphs with small chordality
- On claw-free asteroidal triple-free graphs
- Stability structures of conjunctive Boolean networks
- Equimatchable claw-free graphs
- Are unique subgraphs not easier to find?
- A Hopf algebra for counting cycles
- Sublinear-time algorithms for counting star subgraphs via edge sampling
- Two-walks degree assortativity in graphs and networks
- Enumerating simple paths from connected induced subgraphs
- Finding a sun in building-free graphs
- On the expressive power of linear algebra on graphs
- The fine-grained complexity of multi-dimensional ordering properties
- The many facets of the Estrada indices of graphs and networks
- The complexity of multiple handed self-assembly
- Lazy or eager dynamic matching may not be fast
- Lengths of words accepted by nondeterministic finite automata
- FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams
- Sparse matrix multiplication and triangle listing in the congested clique model
- Triangle edge deletion on planar glasses-free RGB-digraphs
- Improved distance queries and cycle counting by Frobenius normal form
- Evaluating Datalog via tree automata and cycluits
- Answering conjunctive queries with inequalities
- Complex networks: structure and dynamics
- A general purpose algorithm for counting simple cycles and simple paths of any length
- Computing the rooted triplet distance between galled trees by counting triangles
- 3SUM, 3XOR, triangles
- The possible number of cycles in cycle systems
- Counting subgraphs in relational event graphs
- Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract)
- Clique counting in MapReduce: algorithms and experiments
- On generating triangle-free graphs
- Unique subgraphs are not easier to find
- Finding and counting small induced subgraphs efficiently
- Time windowed data structures for graphs
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
- Fast Output-Sensitive Matrix Multiplication
- A task-scheduling approach for efficient sparse symmetric matrix-vector multiplication on a GPU
- Balanced hashing, color coding and approximate counting
- scientific article; zbMATH DE number 3937199 (Why is no real title available?)
- Colorful triangle counting and a \textsc{MapReduce} implementation
- Arboricity, \(h\)-index, and dynamic algorithms
- scientific article; zbMATH DE number 1215999 (Why is no real title available?)
- Color-coding
- Extended dynamic subgraph statistics using h-index parameterized data structures
- Faster all-pairs shortest paths via circuit complexity
- Approximately counting triangles in sublinear time
- scientific article; zbMATH DE number 7049740 (Why is no real title available?)
- On the characteristic polynomial of the power of a path
- Method for quickly inferring the mechanisms of large-scale complex networks based on the census of subgraph concentrations
- An efficient algorithm for Helly property recognition in a linear hypergraph
- Finding a long directed cycle
- Why do simple algorithms for triangle enumeration work in the real world?
- Local graph stability in exponential family random graph models
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
- From circuit complexity to faster all-pairs shortest paths
- Testing for Equivalence of Network Distribution Using Subgraph Counts
- Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP
- Triangles and girth in disk graphs and transmission graphs
- Tensor network complexity of multilinear maps
- Counting connected subgraphs with maximum-degree-aware sieving
- Counting Triangles under Updates in Worst-Case Optimal Time
- On the expressive power of linear algebra on graphs
- Algorithms and hardness for diameter in dynamic graphs
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties
- Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width
- QPTAS and subexponential algorithm for maximum clique on disk graphs
- Maximum cardinality neighbourly sets in quadrilateral free graphs
- Bounds and algorithms for graph trusses
- scientific article; zbMATH DE number 7310089 (Why is no real title available?)
- Integral regular net-balanced signed graphs with vertex degree at most four
- On the combinatorial power of the Weisfeiler-Lehman algorithm
- Complexity issues for the sandwich homogeneous set problem
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
- scientific article; zbMATH DE number 6469131 (Why is no real title available?)
- Detecting short directed cycles using rectangular matrix multiplication and dynamic programming
- Optimal listing of cycles and st-paths in undirected graphs
- scientific article; zbMATH DE number 7053319 (Why is no real title available?)
- Graph classes and forbidden patterns on three vertices
- Graph pattern detection: hardness for all induced patterns and faster noninduced cycles
- Counting Subgraphs in Degenerate Graphs
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments
- A numerical approach to long cycles in graphs and digraphs
- Counting Homomorphic Cycles in Degenerate Graphs
- Find subtrees of specified weight and cycles of specified length in linear time
- Triangle‐free equimatchable graphs
- Number of cycles of small length in a graph
- scientific article; zbMATH DE number 7765381 (Why is no real title available?)
- Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
- On linear algebraic algorithms for the subgraph matching problem and its variants
- Topological network entanglement as order parameter for the emergence of geometry
- Finding small complete subgraphs efficiently
- Stronger 3-SUM lower bounds for approximate distance oracles via additive combinatorics
- Removing additive structure in 3SUM-based reductions
- Fast distributed algorithms for girth, cycles and small subgraphs
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)
