Finding small complete subgraphs efficiently

DOI10.1007/978-3-031-34347-6_16arXiv2308.11146MaRDI QIDQ6182903

Adrian Dumitrescu, Andrzej Lingas

Publication date: 22 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2308.11146

zbMATH Keywords

trianglerectangular matrix multiplicationgraph arboricitysubgraph detection/counting

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding and counting small induced subgraphs efficiently
• Finding and counting given length cycles
• On the complexity of fixed parameter clique and dominating set
• Matrix multiplication via arithmetic progressions
• Arboricity and bipartite subgraph listing algorithms
• Efficient algorithms for subgraph listing
• Counting cycles and finite dimensional \(L^{p}\) norms
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Dynamic Set Intersection
• Arboricity and Subgraph Listing Algorithms
• Finding a Minimum Circuit in a Graph
• Edge-Coloring and f-Coloring for Various Classes of Graphs
• Approximately Counting Triangles in Sublinear Time
• Listing Triangles
• Triangle Listing Algorithms: Back from the Diversion
• k-Degenerate Graphs
• Decomposition of Finite Graphs Into Forests
• Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning

This page was built for publication: Finding small complete subgraphs efficiently