scientific article; zbMATH DE number 7561542

DOI10.4230/LIPIcs.ICALP.2019.49MaRDI QIDQ5091203

Guillaume Ducoffe

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

weighted graphsgirthapproximation algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (1)

Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient approximation algorithms for shortest cycles in undirected graphs
• Approximating the Girth
• Approximate distance oracles for unweighted graphs in expected O ( n ² ) time
• Approximate distance oracles
• Finding a Minimum Circuit in a Graph
• Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
• Approximate distance oracles with constant query time
• Better Approximation Algorithms for the Graph Diameter
• Distance Oracles beyond the Thorup--Zwick Bound
• Minimum Weight Cycles and Triangles: Equivalences and Algorithms
• On Graphs that do not Contain a Thomsen Graph
• Automata, Languages and Programming

This page was built for publication: