(Quasi-)linear time algorithm to compute LexDFS, LexUP and LexDown orderings
Data Structures and Algorithms
2017-01-05 v2
Abstract
We consider the three graph search algorithm LexDFS, LexUP and LexDOWN. We show that LexUP orderings can be computed in linear time by an algorithm similar to the one which compute LexBFS. Furthermore, LexDOWN orderings and LexDFS orderings can be computed in time where is the number of vertices and the number of edges.
Cite
@article{arxiv.1701.00305,
title = {(Quasi-)linear time algorithm to compute LexDFS, LexUP and LexDown orderings},
author = {Arthur Milchior},
journal= {arXiv preprint arXiv:1701.00305},
year = {2017}
}