Efficient algorithms for subgraph listing

DOI10.3390/A7020243zbMath1461.05224OpenAlexW1993889441MaRDI QIDQ1736617

Andrzej Lingas, Niklas Zechner

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a7020243

zbMATH Keywords

trianglecliquetime complexitysubgraphsubgraph isomorphismoutput-sensitive algorithmsubgraph listing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Finding small complete subgraphs efficiently

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix multiplication via arithmetic progressions
• Faster multi-witnesses for Boolean matrix multiplication
• A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs
• Arboricity and Subgraph Listing Algorithms
• Finding a Minimum Circuit in a Graph
• Multiplying matrices faster than coppersmith-winograd
• Experimental and Efficient Algorithms

This page was built for publication: Efficient algorithms for subgraph listing