Finding and counting small tournaments in large tournaments
From MaRDI portal
Publication:6652454
DOI10.1016/J.TCS.2024.114911MaRDI QIDQ6652454
Publication date: 12 December 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding and counting small induced subgraphs efficiently
- Finding and counting given length cycles
- On the complexity of fixed parameter clique and dominating set
- Finding, minimizing, and counting weighted subgraphs
- Counting and detecting small subgraphs via equations
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- The Voting Problem
- Quasi-random tournaments
- Arboricity and Subgraph Listing Algorithms
- Simple Constructions of Almost k-wise Independent Random Variables
- Finding a Minimum Circuit in a Graph
- Finding Even Cycles Even Faster
- Color-coding
- Subcubic Equivalences Between Path, Matrix, and Triangle Problems
- Homomorphisms are a good basis for counting small subgraphs
- Graph pattern detection: hardness for all induced patterns and faster non-induced cycles
- On the Density of Transitive Tournaments
- Finding Four-Node Subgraphs in Triangle Time
- Detecting and Counting Small Pattern Graphs
- The Theory of Round Robin Tournaments
- Faster Subgraph Counting in Sparse Graphs
- Counting Subgraphs in Degenerate Graphs
- Counting homomorphic cycles in degenerate graphs
- New bounds for matrix multiplication: from alpha to omega
This page was built for publication: Finding and counting small tournaments in large tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652454)
