A Heuristic for Direct Product Graph Decomposition

DOI10.7155/JGAA.00635zbMath1522.05368arXiv2107.03133OpenAlexW3178365484MaRDI QIDQ6075715

Moreno Marzolla, Luca Calderoni, Luciano Margara

Publication date: 20 September 2023

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

polynomial-time algorithmgraph isomorphismdirected, unweighted graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring cardinal product graphs in polynomial time
• The ubiquitous Kronecker product
• A finite automata approach to modeling the cross product of interconnection networks.
• Direct product primality testing of graphs is GI-hard
• The Kronecker Product of Graphs
• Independent sets in tensor graph powers
• Logspace computations in graph products

This page was built for publication: A Heuristic for Direct Product Graph Decomposition