Updated on 2022/03/31

写真a

 
LE GALL Francois Pierre Marcel
 
Organization
Graduate School of Mathematics Computational Mathematics Professor
Graduate School
Graduate School of Mathematics
Undergraduate School
School of Science Department of Mathematics
Title
Professor
Contact information
メールアドレス
External link

Degree 1

  1. Phd (Computer Science) ( 2006.3   The University of Tokyo ) 

Research Interests 4

  1. Quantum computing

  2. Computational complexity

  3. Distributed computing

  4. Algorithms

Research Areas 1

  1. Informatics / Theory of informatics

Current Research Project and SDGs 4

  1. Distributed Computing

  2. Quantum computing

  3. Computational Complexity

  4. Algorithms

Research History 4

  1. Nagoya University   Graduate School of Mathematics   Associate professor

    2019.10

  2. Kyoto University   Graduate School of Informatics   Designated associate professor

    2016.4 - 2019.9

  3. The University of Tokyo   Graduate School of Information Science and Technology   Designated associate professor

    2012.4 - 2016.3

  4. The University of Tokyo   Graduate School of Information Science and Technology   Designated lecturer

    2009.4 - 2012.3

Professional Memberships 3

  1. INFORMATION PROCESSING SOCIETY OF JAPAN

  2. EATCS

  3. ACM SIGACT

Committee Memberships 3

  1. ACM Transactions on Quantum Computing   Editorial board member  

    2019.6   

  2. Computational Complexity   Editorial board member  

    2016.6   

      More details

    Committee type:Academic society

  3. 電子情報通信学会   コンピュテーション研究会専門委員  

    2016.6   

      More details

    Committee type:Academic society

Awards 2

  1. NISTEP Award 2017

    2017.11   MEXT  

    Francois Le Gall

  2. ISSAC 2014 Distinguished Paper Award

    2014.7   ACM-SIGAL  

 

Papers 33

  1. Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems.

    François Le Gall, Saeed Seddighin

    Proceedings of the 13th Innovations in Theoretical Computer Science conference (ITCS 2022)     page: 97 - 23   2022

     More details

    Publishing type:Research paper (international conference proceedings)  

    DOI: 10.4230/LIPIcs.ITCS.2022.97

    Other Link: https://dblp.uni-trier.de/db/conf/innovations/innovations2022.html#GallS22

  2. Distributed Quantum Proofs for Replicated Data. Reviewed

    Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz

    Proceedings of the 12th Innovations in Theoretical Computer Science conference (ITCS 2021)     page: 28 - 20   2021

     More details

    Publishing type:Research paper (international conference proceedings)  

    DOI: 10.4230/LIPIcs.ITCS.2021.28

    Other Link: https://dblp.uni-trier.de/db/conf/innovations/innovations2021.html#FraigniaudGNP21

  3. Tight Distributed Listing of Cliques. Reviewed

    Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf

    Proceedings of the 32nd ACM-SIAM Symposium on Discrete Algorithms (SODA 2021)     page: 2878 - 2891   2021

     More details

    Publishing type:Research paper (international conference proceedings)  

    DOI: 10.1137/1.9781611976465.171

    Other Link: https://dblp.uni-trier.de/db/conf/soda/soda2021.html#Censor-HillelCG21

  4. Quantum Distributed Algorithms for Detection of Cliques.

    Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman

    Proceedings of the 13th Innovations in Theoretical Computer Science conference (ITCS 2022)     page: 35 - 25   2022

     More details

    Publishing type:Research paper (international conference proceedings)  

    DOI: 10.4230/LIPIcs.ITCS.2022.35

    Other Link: https://dblp.uni-trier.de/db/conf/innovations/innovations2022.html#Censor-HillelFG22

  5. Quantum Logarithmic Space and Post-Selection. Reviewed

    François Le Gall, Harumichi Nishimura, Abuzer Yakaryilmaz

    Proceedings of the 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021)     page: 10 - 17   2021

     More details

    Publishing type:Research paper (international conference proceedings)  

    DOI: 10.4230/LIPIcs.TQC.2021.10

    Other Link: https://dblp.uni-trier.de/db/conf/tqc/tqc2021.html#GallNY21

  6. Test of Quantumness with Small-Depth Quantum Circuits. Reviewed

    Shuichi Hirahara, François Le Gall

    Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)     page: 59 - 15   2021

     More details

    Publishing type:Research paper (international conference proceedings)  

    DOI: 10.4230/LIPIcs.MFCS.2021.59

    Other Link: https://dblp.uni-trier.de/db/conf/mfcs/mfcs2021.html#HiraharaG21

  7. Lower Bounds for Induced Cycle Detection in Distributed Computing.

    François Le Gall, Masayuki Miyamoto

    Proceedings of the 32nd International Symposium on Algorithms and Computation (ISAAC 2021)     page: 58 - 19   2021

     More details

    Publishing type:Research paper (international conference proceedings)  

    DOI: 10.4230/LIPIcs.ISAAC.2021.58

    Other Link: https://dblp.uni-trier.de/db/conf/isaac/isaac2021.html#GallM21

  8. Quantum communication complexity of distribution testing.

    Aleksandrs Belovs, Arturo Castellanos, Francois Le Gall, Guillaume Malod, Alexander A. Sherstov

    Quantum Information & Computation   Vol. 21 ( 15&16 ) page: 1261 - 1273   2021

     More details

    Publishing type:Research paper (scientific journal)  

    DOI: 10.26421/QIC21.15-16-1

  9. Quantum Advantage with Shallow Circuits Under Arbitrary Corruption.

    Atsuya Hasegawa, François Le Gall

    Proceedings of the 32nd International Symposium on Algorithms and Computation (ISAAC 2021)     page: 74 - 16   2021

     More details

    Publishing type:Research paper (international conference proceedings)  

    DOI: 10.4230/LIPIcs.ISAAC.2021.74

    Other Link: https://dblp.uni-trier.de/db/conf/isaac/isaac2021.html#HasegawaG21

  10. Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. Reviewed

    Taisuke Izumi, François Le Gall, Frédéric Magniez

    37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)   Vol. 154   page: 23 - 13   2020

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    DOI: 10.4230/LIPIcs.STACS.2020.23

    Web of Science

    Other Link: https://dblp.uni-trier.de/db/conf/stacs/stacs2020.html#IzumiGM20

  11. Barriers for Rectangular Matrix Multiplication.

    Matthias Christandl, François Le Gall, Vladimir Lysikov, Jeroen Zuiddam

    Electron. Colloquium Comput. Complex.   Vol. 27   page: 30 - 30   2020

     More details

    Publishing type:Research paper (scientific journal)  

    Other Link: https://dblp.uni-trier.de/db/journals/eccc/eccc27.html#ChristandlGLZ20

  12. Quantum-Inspired Classical Algorithms for Singular Value Transformation. Reviewed

    Dhawal Jethwani, François Le Gall, Sanjay K. Singh

    Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)     page: 53 - 14   2020

     More details

    Publishing type:Research paper (international conference proceedings)  

    DOI: 10.4230/LIPIcs.MFCS.2020.53

    Other Link: https://dblp.uni-trier.de/db/conf/mfcs/mfcs2020.html#JethwaniGS20

  13. Quantum Speedup for the Minimum Steiner Tree Problem. Reviewed

    Masayuki Miyamoto, Masakazu Iwamura, Koichi Kise, François Le Gall

    Proceedings of the 26th International Computing and Combinatorics Conference (COCOON 2020)     page: 234 - 245   2020

     More details

    Publishing type:Research paper (international conference proceedings)  

    DOI: 10.1007/978-3-030-58150-3_19

    Other Link: https://dblp.uni-trier.de/db/conf/cocoon/cocoon2020.html#MiyamotoIKG20

  14. On Distributed Listing of Cliques. Reviewed

    Keren Censor-Hillel, François Le Gall, Dean Leitersdorf

    Proceedings of the 39th ACM Symposium on Principles of Distributed Computing (PODC 2020)     page: 474 - 482   2020

     More details

    Publishing type:Research paper (international conference proceedings)  

    DOI: 10.1145/3382734.3405742

    Other Link: https://dblp.uni-trier.de/db/conf/podc/podc2020.html#Censor-HillelGL20

  15. Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. Reviewed

    Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, Rotem Oshman

    Proceedings of the 34th International Symposium on Distributed Computing (DISC 2020)     page: 33 - 17   2020

     More details

    Publishing type:Research paper (international conference proceedings)  

    DOI: 10.4230/LIPIcs.DISC.2020.33

    Other Link: https://dblp.uni-trier.de/db/conf/wdag/disc2020.html#Censor-HillelFG20

  16. Brief Announcement: Distributed Quantum Proofs for Replicated Data. Reviewed

    Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz

    Proceedings of the International Symposium on Distributed Computing (DISC 2020)     page: 43 - 3   2020

     More details

    Publishing type:Research paper (international conference proceedings)  

    DOI: 10.4230/LIPIcs.DISC.2020.43

    Other Link: https://dblp.uni-trier.de/db/conf/wdag/disc2020.html#FraigniaudGNP20

  17. Finding Small and Large $k$-Clique Instances on a Quantum Computer Reviewed

    Sara Ayman Metwalli, Francois Le Gall, Rodney Van Meter

    IEEE Transactions on Quantum Engineering   Vol. 1   page: 1 - 11   2020

     More details

    Publishing type:Research paper (scientific journal)   Publisher:Institute of Electrical and Electronics Engineers (IEEE)  

    DOI: 10.1109/tqe.2020.3045692

  18. Average-Case Quantum Advantage with Shallow Circuits. Reviewed

    François Le Gall

    34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA.     page: 21:1-21:20   2019

     More details

    Publisher:Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik  

  19. Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model. Reviewed

    Taisuke Izumi, François Le Gall

    Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019.     page: 84 - 93   2019

     More details

    Publisher:ACM  

    DOI: 10.1145/3293611.3331628

  20. Quantum Advantage for the LOCAL Model in Distributed Computing. Reviewed

    François Le Gall, Ansis Rosmanis, Harumichi Nishimura

    36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany     page: 49:1-49:14   2019

     More details

    Publisher:Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik  

  21. Quantum Advantage for the LOCAL Model in Distributed Computing

    Le Gall Francois, Nishimura Harumichi, Rosmanis Ansis

    36TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2019)     2019

     More details

  22. Generalized Quantum Arthur-Merlin Games. Reviewed

    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura

    SIAM J. Comput.   Vol. 48 ( 3 ) page: 865 - 902   2019

  23. Quantum Query Complexity of Unitary Operator Discrimination. Reviewed

    Akinori Kawachi, Kenichi Kawano, Francois Le Gall, Suguru Tamaki

    IEICE Transactions   Vol. 102-D ( 3 ) page: 483 - 491   2019

  24. Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. Reviewed

    François Le Gall, Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi

    43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK     page: 26:1-26:13   2018

     More details

    Publisher:Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik  

    DOI: 10.4230/LIPIcs.MFCS.2018.26

  25. Improved rectangular matrix multiplication using powers of the coppersmith-winograd tensor Reviewed

    François Le Gall, Florent Urrutia

    Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms     page: 1029 - 1046   2018

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:Association for Computing Machinery  

    In the past few years, successive improvements of the asymptotic complexity of square matrix multiplication have been obtained by developing novel methods to analyze the powers of the Coppersmith-Winograd tensor, a basic construction introduced thirty years ago. In this paper we show how to generalize this approach to make progress on the complexity of rectangular matrix multiplication as well, by developing a framework to analyze powers of tensors in an asymmetric way. By applying this methodology to the fourth power of the Coppersmith-Winograd tensor, we succeed in improving the complexity of rectangular matrix multiplication. Let denote the maximum value such that the product of an n n matrix by an n n matrix can be computed with O(n2+) arithmetic operations for any &gt
    0. By analyzing the fourth power of the Coppersmith-Winograd tensor using our methods, we obtain the new lower bound &gt
    0:31389, which improves the previous lower bound &gt
    0:30298 obtained by Le Gall (FOCS'12) from the analysis of the second power of the Coppersmith-Winograd tensor. More generally, we give faster algorithms computing the product of an n nk matrix by an nk n matrix for any value k 6= 1. (In the case k = 1, we recover the bounds recently obtained for square matrix multiplication). These improvements immediately lead to improvements in the complexity of a multitude of fundamental problems for which the bottleneck is rectangular matrix multiplication, such as computing the all-pair shortest paths in directed graphs with bounded weights.

    DOI: 10.1137/1.9781611975031.67

    Scopus

  26. Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks. Reviewed

    François Le Gall, Frédéric Magniez

    Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, July 23-27, 2018     page: 337 - 346   2018

     More details

  27. Quantum Algorithm for Triangle Finding in Sparse Graphs Reviewed

    Francois Le Gall, Shogo Nakajima

    ALGORITHMICA   Vol. 79 ( 3 ) page: 941 - 959   2017.11

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:SPRINGER  

    This paper presents a quantum algorithm for triangle finding over sparse graphs that improves over the previous best quantum algorithm for this task by Buhrman et al. (SIAM J Comput 34(6):1324-1330, 2005). Our algorithm is based on the recent (O) over tilde (n(5/4))-query algorithm given by Le Gall (Proceedings of the 55th IEEE annual symposium on foundations of computer science, pp 216-225, 2014) for triangle finding over dense graphs (here n denotes the number of vertices in the graph). We show in particular that triangle finding can be solved with O(n(5/4-epsilon)) queries for some constant epsilon > 0 whenever the graph has at most O(n(2-c))edges for some constant c > 0.

    DOI: 10.1007/s00453-016-0267-z

    Web of Science

  28. MODIFIED GROUP NON-MEMBERSHIP IS IN PROMISE-AWPP RELATIVE TO GROUP ORACLES Reviewed

    Tomoyuki Morimae, Harumichi Nishimura, Francois Le Gall

    QUANTUM INFORMATION & COMPUTATION   Vol. 17 ( 3-4 ) page: 242 - 250   2017.3

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:RINTON PRESS, INC  

    It is known that the group non-membership problem is in QMA relative to any group oracle and in SPPnBQP for solvable groups. We consider a modified version of the group non-membership problem where the order of the group is also given as an additional input. We show that the problem is in (the promise version of) AWPP relative to any group oracle. To show the result, we use the idea of postselected quantum computing.

    Web of Science

    Other Link: http://dblp.uni-trier.de/db/journals/qic/qic17.html#journals/qic/MorimaeNG17

  29. Quantum Algorithms for Matrix Products over Semirings. Reviewed

    François Le Gall, Harumichi Nishimura

    Chicago J. Theor. Comput. Sci.   Vol. 2017   2017

  30. Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers. Reviewed

    Dean Doron, François Le Gall, Amnon Ta-Shma

    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA     page: 41:1-41:20   2017

     More details

    Publisher:Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik  

    DOI: 10.4230/LIPIcs.APPROX-RANDOM.2017.41

  31. Multiparty Quantum Communication Complexity of Triangle Finding. Reviewed

    François Le Gall, Shogo Nakajima

    12th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2017, June 14-16, 2017, Paris, France     page: 6:1-6:11   2017

     More details

    Publisher:Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik  

    DOI: 10.4230/LIPIcs.TQC.2017.6

  32. Quantum query complexity of unitary operator discrimination Reviewed

    Akinori Kawachi, Kenichi Kawano, François Le Gall, Suguru Tamaki

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   Vol. 10392   page: 309 - 320   2017

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:Springer Verlag  

    Unitary operator discrimination is a fundamental problem in quantum information theory. The basic version of this problem can be described as follows: given a black box implementing a quantum the promise that the black box implements either the unitary operator U:1 or the unitary operator U:2, the goal is to decide whether U=U:1 or U=U:2. In this paper, we consider the query complexity of this problem. We show that there exists a quantum algorithm that solves this problem with bounded-error probability using (formula presented) \\right\\rceil queries to the black-box, where \\theta _\\mathrm{cover} represents the “closeness” between U:1 and U:2 (this parameter is determined by the eigenvalues of the matrix (formula presented). We also show that this upper bound is essentially tight: we prove that there exist operators U:1 and U:2 such that any quantum algorithm solving this problem with bounded-error probability requires at least (formula presented) queries.

    DOI: 10.1007/978-3-319-62389-4_26

    Scopus

  33. Triangle Finding and Listing in CONGEST Networks. Reviewed

    Taisuke Izumi, François Le Gall

    Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017     page: 381 - 389   2017

     More details

▼display all

Presentations 2

  1. Quantum algorithms for large-scale problems Invited International conference

    François Le Gall

    Quantum Innovation 2021, the International Symposium on Quantum Science, Technology and Innovation  2021.12.9 

     More details

    Event date: 2021.12

    Language:English   Presentation type:Oral presentation (invited, special)  

  2. Tight Distributed Listing of Cliques Invited

    2021.3.8 

     More details

    Event date: 2021.3

KAKENHI (Grants-in-Aid for Scientific Research) 8

  1. Construction of Quantum Computaional Infrastracture towards Quantum Information Society

    Grant number:21H04879  2021.4 - 2026.3

    Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research (A)

      More details

    Authorship:Coinvestigator(s) 

  2. 量子アルゴリズムの理論と実装を接続する革新的基盤の創出

    Grant number:20H05966  2020.11 - 2025.3

    科学研究費助成事業  学術変革領域研究(A)

    山下 茂, 山本 直樹, ルガル フランソワ, 森 立平, 谷 誠一郎, 西村 治道

      More details

    Authorship:Coinvestigator(s) 

    量子計算各種モデルにおける計算能力の解析を行う理論的なアプローチと、実際に量子計算機を利用する実践的なアプローチの両面から以下の4項目の研究を行う。
    (A) 既存の量子計算モデルの結果を量子・古典協調の観点から、あるいは「弱い」量子計算モデルの観点から再検討・再構築する。
    (B) 量子計算に起こりうる現実的なエラーを考慮に入れた計算モデルの検討を進める。
    (C) 量子計算の方式に応じて異なる量子回路のモデルを量子・古典協調利用の枠組みの中で検討・評価する。
    (D) 量子計算と古典計算を協調して利用する計算アルゴリズムの能力を解析するための計算モデルを検討・評価する。

  3. 量子アルゴリズム・計算量・浅層回路と量子コンピュータ実機実験による量子優位性研究

    Grant number:20H00579  2020.4 - 2025.3

    科学研究費助成事業  基盤研究(A)

    今井 浩, 山下 茂, ルガル フランソワ, Avis David

      More details

    Authorship:Coinvestigator(s) 

    量子コンピュータの得意な問題を用いて量子計算優越性を達成したとGoogleの研究者らが主張したところである。しかし、その問題は実応用とは無縁であり、IT社会に多大なインパクトを与えるの量子素因数分解計算などの実機実装の研究が重要となっている。本研究では、量子計算が本研究グループの量子浅層回路の計算量理論・実機に対応する量子回路の設計理論・量子非局所性とその組み合わせ構造に着目することにより、理論的に真に高速と示すことができる量子優位性を有する問題の最先端を研究し、量子コンピュータ実機で実証する。このような取り組みで、量子優位性が直接的に実社会に影響を与える新たな問題群を見出す成果を目指す。

  4. Quantum Algorithms for Large-Scale Quantum Computers: New Horizons and Applications

    Grant number:20H04139  2020.4 - 2024.3

    Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research (B)

      More details

    Authorship:Principal investigator 

    Grant amount:\17290000 ( Direct Cost: \13300000 、 Indirect Cost:\3990000 )

  5. 対話型証明の新展開-古典から量子まで

    Grant number:19H04066  2019.4 - 2023.3

    科学研究費助成事業  基盤研究(B)

    西村 治道, ルガル フランソワ, 森前 智行, Buscemi F.

      More details

    Authorship:Coinvestigator(s) 

    今日の量子計算量理論において,対話型証明の概念は非常に大きな存在となっている.一方で,近年その実装へ向けて社会的注目を集める量子コンピュータはまだ小規模であり,量子メモリや量子通信は依然として高コストである.この状況を鑑みて,本研究では量子計算や量子通信が制限された量子対話型証明や量子計算に動機づけられた古典対話型証明,さらにはその中間的な対話型証明モデルに着目し,それらの対話型証明モデルについての計算量理論を展開する.これにより量子コンピュータの検証問題に対する新しい解決法を提案し,既存の量子対話型証明モデルや量子多項式階層理論を俯瞰的に捉えることができるような包括的成果を得ることを目指す.

  6. Theoretical Research on Quantum Supremacy

    Grant number:19F19079  2019.7 - 2021.3

      More details

    Authorship:Other 

  7. Interpolative Expansion of Quantum Protocol Theory

    Grant number:16H01705  2016.4 - 2021.3

      More details

    Authorship:Coinvestigator(s) 

  8. Algebraic Complexity Theory: New Approaches and Algorithmic Applications

    Grant number:16H05853  2016.4 - 2020.3

    Le Gall Francois

      More details

    Authorship:Principal investigator 

    Grant amount:\12480000 ( Direct Cost: \9600000 、 Indirect Cost:\2880000 )

    In this research project we developed new techniques based on algebraic complexity theory to solve problems from theoretical computer science. Our main achievements are as follows.
    We first developed new approaches to solve algebraic problems, and constructed faster algorithms for rectangular matrix multiplication. We then showed how to apply in a novel way algebraic techniques to several problems from computer science. In particular, via this approach we designed fast distributed algorithms for various computational problems over networks. Finally, we designed several quantum algorithms for graph problems that are faster than the best known algorithms.

▼display all