Path-based depth-first search for strong and biconnected components
From MaRDI portal
Publication:294748
Recommendations
- On finding the strongly connected components in a directed graph
- A space-efficient algorithm for finding strongly connected components
- Planar Strong Connectivity Helps in Parallel Depth-First Search
- Finding strongly connected components in distributed graphs
- Solving multi-agent path finding on strongly biconnected digraphs
- Finding strongly connected components of simple digraphs based on granulation strategy
- Strong-mixed searching and pathwidth
- Finding biconnected components in O(n) time for a class of graphs
- scientific article; zbMATH DE number 1942448
- A stabilizing algorithm for finding biconnected components
Cites work
- scientific article; zbMATH DE number 437527 (Why is no real title available?)
- scientific article; zbMATH DE number 3887060 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3688740 (Why is no real title available?)
- scientific article; zbMATH DE number 42967 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 108390 (Why is no real title available?)
- scientific article; zbMATH DE number 193197 (Why is no real title available?)
- scientific article; zbMATH DE number 487720 (Why is no real title available?)
- scientific article; zbMATH DE number 793950 (Why is no real title available?)
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- A linear-time algorithm for a special case of disjoint set union
- A strong-connectivity algorithm and its applications in data flow analysis
- Cycle Length in a Random Function
- Depth-First Search and Linear Graph Algorithms
- Dividing a Graph into Triconnected Components
- Efficiency of a Good But Not Linear Set Union Algorithm
- Efficient Planarity Testing
- On the computational power of pushdown automata
- Parallel concepts in graph theory
- Path-based depth-first search for strong and biconnected components
- Time and tape complexity of pushdown automaton languages
Cited in
(29)- Computing finite semigroups
- -list vertex coloring in linear time
- On the complexity of strongly connected components in directed hypergraphs
- 4-edge-coloring graphs of maximum degree 3 in linear time
- Finding strong components using depth-first search
- Deriving efficient graph algorithms
- Yet another optimal algorithm for 3-edge-connectivity
- Enumeration of idempotents in planar diagram monoids
- Notes on oriented depth-first search and longest paths
- Stubborn Sets, Frozen Actions, and Fair Testing
- Verification of programs with exceptions through operator precedence automata
- Path-based depth-first search for strong and biconnected components
- Computing maximal subsemigroups of a finite semigroup
- The scaling limit of a critical random directed graph
- A space-efficient algorithm for finding strongly connected components
- Fault tolerant depth first search in undirected graphs: simple yet efficient
- An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time
- Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
- An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
- Space efficient linear time algorithms for BFS, DFS and applications
- Separator-based data reduction for signed graph balancing
- An analysis of repeated graph search
- Finding strongly connected components of simple digraphs based on granulation strategy
- scientific article; zbMATH DE number 3874635 (Why is no real title available?)
- A simple certifying algorithm for 3-edge-connectivity
- scientific article; zbMATH DE number 3949734 (Why is no real title available?)
- Space-efficient biconnected components and recognition of outerplanar graphs
This page was built for publication: Path-based depth-first search for strong and biconnected components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294748)
