Rare siblings speed-up deterministic detection and counting of small pattern graphs
From MaRDI portal
Publication:5925690
DOI10.1007/s00453-022-01063-2OpenAlexW4309582260MaRDI QIDQ5925690
Andrzej Lingas, Mirosław Kowaluk
Publication date: 11 April 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-01063-2
time complexitymatrix multiplicationinduced subgraph isomorphismwitnesses for Boolean matrix product
Cites Work
- Unnamed Item
- Unnamed Item
- Finding and counting small induced subgraphs efficiently
- On graphs without a \(C_{4}\) or a diamond
- On the complexity of fixed parameter clique and dominating set
- Induced subgraph isomorphism: are some patterns substantially easier than others?
- Faster multi-witnesses for Boolean matrix multiplication
- Paw-free graphs
- Fast rectangular matrix multiplication and applications
- Counting and Detecting Small Subgraphs via Equations
- A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques
- Powers of tensors and fast matrix multiplication
- A Linear Recognition Algorithm for Cographs
- Finding a Minimum Circuit in a Graph
- Graph pattern detection: hardness for all induced patterns and faster non-induced cycles
- Finding Four-Node Subgraphs in Triangle Time
- Multiplying matrices faster than coppersmith-winograd
- Detecting and Counting Small Pattern Graphs
- Experimental and Efficient Algorithms
This page was built for publication: Rare siblings speed-up deterministic detection and counting of small pattern graphs
