Faster computing of graph square roots with girth at least six

DOI10.21711/231766362023/RMC5515MaRDI QIDQ6543679zbMATH OpenFDO

Authors Cristopher Carcereri, Aleffer Rocha, Renato Carmo

Publication date 24 May 2024

Published in Matemática Contemporânea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21711/231766362023/RMC5515

zbMATH Keywords

algorithm complexitycycle detectiongraph square roots

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 6027233
• Complexity of finding graph roots with girth conditions
• Computing square roots of graphs with low maximum degree
• Sparse square roots
• Uniqueness of graph square roots of girth six

This page was built for publication: Faster computing of graph square roots with girth at least six

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