Efficient algorithms for subgraph listing

DOI10.3390/A7020243MaRDI QIDQ1736617zbMATH OpenOpenAlexFDO

Authors Niklas Zechner, Andrzej Lingas

Publication date 26 March 2019

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

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)

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

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3906496 (Why is no real title available?)
• scientific article; zbMATH DE number 3910446 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A dynamic data structure for counting subgraphs in sparse graphs
• Arboricity and Subgraph Listing Algorithms
• Experimental and Efficient Algorithms
• Faster multi-witnesses for Boolean matrix multiplication
• Finding a Minimum Circuit in a Graph
• Matrix multiplication via arithmetic progressions
• Multiplying matrices faster than coppersmith-winograd

Cited in

(3)

• Arboricity and Subgraph Listing Algorithms
• Finding small complete subgraphs efficiently
• Output-sensitive listing of bounded-size trees in undirected graphs

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)