Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS (Q2420652): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-018-0270-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2791769939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reprint of: Memory-constrained algorithms for simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search Using $$O(n)$$ Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Space Efficient Algorithms for BFS, DFS and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space efficient linear time algorithms for BFS, DFS and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-efficient algorithms for maximum cardinality search, stack BFS, queue BFS and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Lower Bounds for <i>st</i>-Connectivity on the NNJAG Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A model classifying algorithms as inherently sequential with applications to graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general label search to investigate classical graph search algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection and sorting with limited storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: New linear time algorithms for generating perfect elimination orderings of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations / rank
 
Normal rank

Latest revision as of 11:11, 19 July 2024

scientific article
Language Label Description Also known as
English
Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS
scientific article

    Statements

    Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS (English)
    0 references
    6 June 2019
    0 references
    maximum cardinality search
    0 references
    graph algorithms
    0 references
    breadth-first search
    0 references
    depth-first search
    0 references
    chordal graphs
    0 references

    Identifiers