Fine-grained complexity for sparse graphs
Work
Year: 2018
Type: article
Abstract: We consider the fine-grained complexity of sparse graph problems that currently have Õ(mn) time algorithms, where m is the number of edges and n is the number of vertices in the input graph. This clas... more
Authors Udit Agarwal, Vijaya Ramachandran
Institution The University of Texas at Austin
Cites: 50
Cited by: 13
Related to: 10
FWCI: 1.101
Citation percentile (by year/subfield): 88.32
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Funder National Science Foundation
Grant ID CCF-1320675