Finding and counting given length cycles

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Smallest-last ordering and clustering and graph coloring algorithms
Color-coding
Finding and counting given length cycles
Cycles of even length in graphs
Finding and counting small induced subgraphs efficiently
Arboricity and Subgraph Listing Algorithms
Finding a Minimum Circuit in a Graph
On generalized graphs
Recognizing small subgraphs
Finding Even Cycles Even Faster
Finding short cycles in planar graphs using separators

Cited In (only showing first 100 items - show all)

On triangle estimation using tripartite independent set queries
On the expressive power of linear algebra on graphs
Title not available (Why is that?)
3SUM, 3XOR, triangles
Balanced Hashing, Color Coding and Approximate Counting
Finding and counting given length cycles
Efficient algorithms for clique problems
On claw-free asteroidal triple-free graphs
Parameterized graph separation problems
Unique subgraphs are not easier to find
Complex networks: structure and dynamics
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
On the complexity of fixed parameter clique and dominating set
Two-walks degree assortativity in graphs and networks
Treewidth for graphs with small chordality
Computing the rooted triplet distance between galled trees by counting triangles
Finding and counting small induced subgraphs efficiently
Extended dynamic subgraph statistics using \(h\)-index parameterized data structures
Testing for Equivalence of Network Distribution Using Subgraph Counts
Complexity issues for the sandwich homogeneous set problem
The possible number of cycles in cycle systems
Recognizing graphs without asteroidal triples
Parameterized coloring problems on chordal graphs
Arboricity, \(h\)-index, and dynamic algorithms
A nice class for the vertex packing problem
Finding small complete subgraphs efficiently
Title not available (Why is that?)
Equimatchable claw-free graphs
Title not available (Why is that?)
On the negative cost girth problem in planar networks
Method for quickly inferring the mechanisms of large-scale complex networks based on the census of subgraph concentrations
Title not available (Why is that?)
Triangle counting in dynamic graph streams
A general purpose algorithm for counting simple cycles and simple paths of any length
Colorful triangle counting and a \textsc{MapReduce} implementation
A parameterized view on matroid optimization problems
Number of cycles of small length in a graph
Title not available (Why is that?)
Detecting directed 4-cycles still faster
On linear algebraic algorithms for the subgraph matching problem and its variants
Quantum algorithm for triangle finding in sparse graphs
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
Stability structures of conjunctive Boolean networks
Detecting induced subgraphs
Immersed cycles and the JSJ decomposition
Approximately Counting Triangles in Sublinear Time
The challenges of unbounded treewidth in parameterised subgraph counting problems
On generating triangle-free graphs
The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
Algebraic methods in the congested clique
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP
Counting Subgraphs in Degenerate Graphs
Maximum cardinality neighbourly sets in quadrilateral free graphs
On cube-free median graphs
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
Graph Classes and Forbidden Patterns on Three Vertices
Fast Output-Sensitive Matrix Multiplication
An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph
Why Do Simple Algorithms for Triangle Enumeration Work in the Real World?
Improved distance queries and cycle counting by Frobenius normal form
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams
Counting Triangles under Updates in Worst-Case Optimal Time
Title not available (Why is that?)
Title not available (Why is that?)
Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
On the Combinatorial Power of the Weisfeiler-Lehman Algorithm
Counting Subgraphs in Relational Event Graphs
Faster All-Pairs Shortest Paths via Circuit Complexity
A Task-Scheduling Approach for Efficient Sparse Symmetric Matrix-Vector Multiplication on a GPU
Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles
\( \alpha_i\)-metric graphs: radius, diameter and all eccentricities
Counting Homomorphic Cycles in Degenerate Graphs
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
Title not available (Why is that?)
Getting linear time in graphs of bounded neighborhood diversity
Local Graph Stability in Exponential Family Random Graph Models
Find subtrees of specified weight and cycles of specified length in linear time
From Circuit Complexity to Faster All-Pairs Shortest Paths
Lengths of words accepted by nondeterministic finite automata
The complexity of multiple handed self-assembly
Topological network entanglement as order parameter for the emergence of geometry
Fast distributed algorithms for girth, cycles and small subgraphs
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
Finding a sun in building-free graphs
On the characteristic polynomial of the power of a path.
Clique counting in MapReduce: algorithms and experiments
Bounds and algorithms for graph trusses
Time Windowed Data Structures for Graphs

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)