Space-efficient algorithms for maximum cardinality search, stack BFS, queue BFS and applications

DOI10.1007/978-3-319-62389-4_8zbMath1434.68349OpenAlexW2731520687MaRDI QIDQ2412402

Srinivasa Rao Satti, Sankardeep Chakraborty

Publication date: 23 October 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-62389-4_8

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Space-efficient Euler partition and bipartite edge coloring ⋮ Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ Space-Efficient Algorithms for Longest Increasing Subsequence ⋮ Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS ⋮ Space-efficient biconnected components and recognition of outerplanar graphs ⋮ A Framework for In-place Graph Algorithms ⋮ Space-efficient algorithms for longest increasing subsequence ⋮ Space efficient linear time algorithms for BFS, DFS and applications

This page was built for publication: Space-efficient algorithms for maximum cardinality search, stack BFS, queue BFS and applications