Extended Learning Graphs for Triangle Finding

DOI10.4230/LIPICS.STACS.2017.20MaRDI QIDQ4636618zbMATH OpenOpenAlexFDO

Authors Titouan Carette, Mathieu Laurière, Frédéric Magniez

Publication date 19 April 2018

Full work available at URL https://hal.archives-ouvertes.fr/hal-02107535

zbMATH Keywords

quantum query complexitylearning graphstriangle finding

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Quantum algorithms and complexity in the theory of computing (68Q12) Density (toughness, etc.) (05C42)

Recommendations

• Extended learning graphs for triangle finding
• The recognition of triangle graphs
• The recognition of triangle graphs
• scientific article; zbMATH DE number 12944
• Triangle graphs
• scientific article; zbMATH DE number 1539553
• A recognition algorithm for simple-triangle graphs
• A long trip in the charming world of graphs for pattern recognition

Cited in

(6)

• Multiparty quantum communication complexity of triangle finding
• Derandomization of quantum algorithm for triangle finding
• Improved quantum query algorithms for triangle detection and associativity testing
• On the power of non-adaptive learning graphs
• Improved quantum query algorithms for triangle finding and associativity testing
• Extended learning graphs for triangle finding

This page was built for publication: Extended Learning Graphs for Triangle Finding

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