Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems

12/09/2017
by   Sankardeep Chakraborty, et al.
0

This short note provides space-efficient linear time algorithms for computing bridges, topological sorting, and strongly connected components improving on several recent results of Elmasry et al. [STACS'15], Banerjee et al. [COCOON'16] and Chakraborty et al. [ISAAC'16]. En route, we also provide another DFS implementation with weaker input graph representation assumption without compromising on the time and space bounds of the earlier results of Banerjee et al. [COCOON'16] and Kammer et al. [MFCS'16].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/03/2021

Estimation of underreporting in Brazilian tuberculosis data, 2012-2014

Analysis of burden of underregistration in tuberculosis data in Brazil, ...
research
05/03/2021

Bounds of MIN_NCC and MAX_NCC and filtering scheme for graph domain variables

Graph domain variables and constraints are an extension of constraint pr...
research
05/19/2016

Stereotyping and Bias in the Flickr30K Dataset

An untested assumption behind the crowdsourced descriptions of the image...
research
12/11/2017

On Quadratic Penalties in Elastic Weight Consolidation

Elastic weight consolidation (EWC, Kirkpatrick et al, 2017) is a novel a...
research
06/30/2014

Information Transfer in Swarms with Leaders

Swarm dynamics is the study of collections of agents that interact with ...
research
08/07/2019

Space-Efficient Gradual Typing in Coercion-Passing Style

Herman et al. (2007, 2010) pointed out that the insertion of run-time ch...
research
06/02/2017

Facies classification from well logs using an inception convolutional network

The idea to use automated algorithms to determine geological facies from...

Please sign up or login with your details

Forgot password? Click here to reset