• Corpus ID: 15711629

(Quasi-)linear time algorithm to compute LexDFS, LexUP and LexDown orderings

@article{Milchior2017QuasilinearTA,
  title={(Quasi-)linear time algorithm to compute LexDFS, LexUP and LexDown orderings},
  author={Arthur Milchior},
  journal={ArXiv},
  year={2017},
  volume={abs/1701.00305}
}
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 $\left(n+m\log m\right)$ where $n$ is the number of vertices and $m$ the number of edges. 
[PDF] Semantic Reader

Figures and Tables from this paper

References

SHOWING 1-4 OF 4 REFERENCES

Graph searches with applications to cocomparability graphs

This thesis contains a global study on graph searches, introducing a new formal madel to study graph search, and mainly study the maximal antichain lattice of a partial order.

Algorithmic Aspects of Vertex Elimination on Graphs

A graph-theoretic elimination process which is related to performing Gaussian elimination on sparse symmetric positive definite systems of linear equations is considered, and it is conjecture that the problem of finding a minimum ordering is NP-complete.

A Unified View of Graph Searching

This paper unifies the view of graph search algorithms by showing simple, closely related characterizations of various well-known search paradigms, including BFS and DFS, and these characterizations naturally lead to other search paradigsms, namely, maximal neighborhood search and LexDFS.

Efficient computation of a LexUP Input: An undirected graph G = (V, E) Output: an ordering σ of the vertices of G 1 vertices: array of n elements of type vertex

  • Algorithm