Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs
Sign Up to like & getrecommendations! Published in 2018 at "Algorithmica"
DOI: 10.1007/s00453-018-0464-z
Abstract: We present space-efficient algorithms for computing cut vertices in a given graph with n vertices and m edges in linear time using $$O(n+\min \{m,n\log \log n\})$$O(n+min{m,nloglogn}) bits. With the same time and using $$O(n+m)$$O(n+m) bits,… read more here.
Keywords: biconnected components; log; outerplanar graphs; space efficient ... See more keywords