Finding and counting given length cycles
From MaRDI portal
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)- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
- scientific article; zbMATH DE number 7310089 (Why is no real title available?)
- Finding small complete subgraphs efficiently
- Method for quickly inferring the mechanisms of large-scale complex networks based on the census of subgraph concentrations
- Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract)
- On the expressive power of linear algebra on graphs
- Optimal listing of cycles and \(st\)-paths in undirected graphs
- On cube-free median graphs
- Finding a long directed cycle
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Equimatchable claw-free graphs
- The challenges of unbounded treewidth in parameterised subgraph counting problems
- On generating triangle-free graphs
- A general purpose algorithm for counting simple cycles and simple paths of any length
- Efficient approximation algorithms for shortest cycles in undirected graphs
- Approximately counting triangles in sublinear time
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
- Parity check matrices and product representations of squares
- Immersed cycles and the JSJ decomposition
- Recognizing graphs without asteroidal triples
- On triangle estimation using tripartite independent set queries
- On the complexity of fixed parameter clique and dominating set
- Number of cycles of small length in a graph
- Unique subgraphs are not easier to find
- Treewidth for graphs with small chordality
- Two-walks degree assortativity in graphs and networks
- Fast Output-Sensitive Matrix Multiplication
- Detecting directed 4-cycles still faster
- On the expressive power of linear algebra on graphs
- Counting Subgraphs in Degenerate Graphs
- Extended dynamic subgraph statistics using \(h\)-index parameterized data structures
- Efficient algorithms for clique problems
- Colorful triangle counting and a \textsc{MapReduce} implementation
- Arboricity, \(h\)-index, and dynamic algorithms
- Testing for Equivalence of Network Distribution Using Subgraph Counts
- scientific article; zbMATH DE number 7053319 (Why is no real title available?)
- Stability structures of conjunctive Boolean networks
- Computing the rooted triplet distance between galled trees by counting triangles
- Parameterized coloring problems on chordal graphs
- Are unique subgraphs not easier to find?
- A Hopf algebra for counting cycles
- Sublinear-time algorithms for counting star subgraphs via edge sampling
- Balanced hashing, color coding and approximate counting
- Complexity of counting cycles using zeons
- Complexity issues for the sandwich homogeneous set problem
- scientific article; zbMATH DE number 7561506 (Why is no real title available?)
- Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP
- Detecting short directed cycles using rectangular matrix multiplication and dynamic programming
- 3SUM, 3XOR, triangles
- A parameterized view on matroid optimization problems
- A nice class for the vertex packing problem
- On claw-free asteroidal triple-free graphs
- Maximum cardinality neighbourly sets in quadrilateral free graphs
- On linear algebraic algorithms for the subgraph matching problem and its variants
- Finding and counting small induced subgraphs efficiently
- scientific article; zbMATH DE number 3937199 (Why is no real title available?)
- The possible number of cycles in cycle systems
- scientific article; zbMATH DE number 6469131 (Why is no real title available?)
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- Complex networks: structure and dynamics
- Finding and counting given length cycles
- Parameterized graph separation problems
- An efficient algorithm for Helly property recognition in a linear hypergraph
- Graph classes and forbidden patterns on three vertices
- On the negative cost girth problem in planar networks
- The fine-grained complexity of multi-dimensional ordering properties
- Triangle‐free equimatchable graphs
- On the combinatorial power of the Weisfeiler-Lehman algorithm
- Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
- Finding a sun in building-free graphs
- Finding and counting small tournaments in large tournaments
- A task-scheduling approach for efficient sparse symmetric matrix-vector multiplication on a GPU
- Time windowed data structures for graphs
- Integral regular net-balanced signed graphs with vertex degree at most four
- Clique counting in MapReduce: algorithms and experiments
- Answering conjunctive queries with inequalities
- Removing additive structure in 3SUM-based reductions
- Stronger 3-SUM lower bounds for approximate distance oracles via additive combinatorics
- The many facets of the Estrada indices of graphs and networks
- scientific article; zbMATH DE number 7765381 (Why is no real title available?)
- \( \alpha_i\)-metric graphs: radius, diameter and all eccentricities
- Improved distance queries and cycle counting by Frobenius normal form
- Lazy or eager dynamic matching may not be fast
- Faster all-pairs shortest paths via circuit complexity
- The complexity of multiple handed self-assembly
- Find subtrees of specified weight and cycles of specified length in linear time
- scientific article; zbMATH DE number 7049740 (Why is no real title available?)
- From circuit complexity to faster all-pairs shortest paths
- Counting subgraphs in relational event graphs
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
- Triangle edge deletion on planar glasses-free RGB-digraphs
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments
- Counting connected subgraphs with maximum-degree-aware sieving
- Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width
- QPTAS and subexponential algorithm for maximum clique on disk graphs
- A numerical approach to long cycles in graphs and digraphs
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties
- Triangles and girth in disk graphs and transmission graphs
- Local graph stability in exponential family random graph models
- Topological network entanglement as order parameter for the emergence of geometry
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)
