Efficient algorithms for subgraph listing

DOI10.3390/A7020243zbMATH Open1461.05224OpenAlexW1993889441MaRDI QIDQ1736617FDOQ1736617

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

Recommendations

• Faster algorithms for finding and counting subgraphs
• Arboricity and Subgraph Listing Algorithms
• Detecting and counting small pattern graphs
• Detecting and Counting Small Pattern Graphs
• Recognizing small subgraphs

zbMATH Keywords

trianglecliquesubgraph isomorphismtime complexitysubgraphoutput-sensitive algorithmsubgraph listing

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Multiplying matrices faster than coppersmith-winograd
• Matrix multiplication via arithmetic progressions
• Title not available (Why is that?)
• Arboricity and Subgraph Listing Algorithms
• Finding a Minimum Circuit in a Graph
• Title not available (Why is that?)
• Experimental and Efficient Algorithms
• Faster multi-witnesses for Boolean matrix multiplication
• A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs

Cited In (2)

• Arboricity and Subgraph Listing Algorithms
• Finding small complete subgraphs efficiently

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736617)