Conditionally optimal approximation algorithms for the girth of a directed graph

Conditionally optimal approximation algorithms for the girth of a directed graph

© Mina Dalirrooyfard and Virginia Vassilevska Williams; licensed under Creative Commons License CC-BY 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). The girth is one of the most basic graph parameters, and its computation has been studied for many decades. Under...

Full description

Bibliographic Details
Main Authors: Dalirrooyfard, Mina, Williams, Virginia Vassilevska
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:English
Published: 2021
Online Access:https://hdl.handle.net/1721.1/137026

Internet

https://hdl.handle.net/1721.1/137026

Similar Items