Depth-First Search and Linear Graph Algorithms
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Finding a feasible flow in a strongly connected network
- HyPAM: A hybrid continuum-particle model for incompressible free-surface flows
- Yet another optimal algorithm for 3-edge-connectivity
- On the complexity of finding balanced oneway cuts
- On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs
- Testing planarity of geometric automorphisms in linear time
- Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers
- The graph sandwich problem for P₄-sparse graphs
- An efficient algorithm to find next-to-shortest path on permutation graphs
- From liveness to promptness
- Backdoor sets of quantified Boolean formulas
- Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
- Sur la classification syntaxique
- Orientations with single source and sink
- Application of net subgroups to the theory of sparse matrices
- An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs
- Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra
- An efficient ELL(1)-parser generator
- Decomposition by clique separators
- Depth-first search is inherently sequential
- An approach to the subgraph homeomorphism problem
- Sensitivity analysis of an agricultural linear programming model
- Solving NP-hard problems in 'almost trees': vertex cover
- Uniquely solvable quadratic Boolean equations
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
- Generalized Steiner problem in outerplanar networks
- An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
- System structure: stability and controllability
- A compact labelling scheme for series-parallel graphs
- A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices
- Efficient symbolic analysis of programs
- A decomposition algorithm for multi-terminal network flows
- A taxonomy of binary tree traversals
- Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery
- An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems
- On the detection of unstructuredness in flowgraphs
- An introduction to the regular theory of fairness
- A random NC algorithm for depth first search
- A topological approach to dynamic graph connectivity
- A linear-processor algorithm for depth-first search in planar graphs
- A linear algorithm to solve fixed-point equations on transition systems
- Acyclic k-connected subgraphs for distributed alternate routing in communications networks
- A decomposition method for minimizing quadratic pseudo-Boolean functions
- Stratification and knowledge base management
- On orientations and shortest paths
- Reasoning with minimal models: efficient algorithms and applications
- State-variable planning under structural restrictions: algorithms and complexity
- Efficient minimization of homogeneous FSMs for fault diagnosis
- Graph traversal and top-down evaluation of logic queries
- Uniform data encodings
- Optimum and suboptimum methods for permuting a matrix into bordered triangular form
- The subgraph homeomorphism problem
- Depth-first K-trees and critical path analysis
- Degree switching operations in networks and large scale systems assignment problems
- The node-deletion problem for hereditary properties is NP-complete
- On a cycle finding algorithm
- The Schorr-Waite marking algorithm revisited
- Maximum matchings and trees
- A note on odd and even factors of undirected graphs
- A sensitive transitive closure algorithm
- An effective structured approach to finding optimal partitions of networks
- st-ordering the vertices of biconnected graphs
- An algorithm for finding optimum path in networks
- A graph theoretic approach to switching function minimization
- Depth-first search and the vertex cover problem
- Enumerating the cycles of a digraph: a new preprocessing strategy
- On minimum dominating sets with minimum intersection
- A counting algorithm for a cyclic binary query
- On the largest strong components in m-out digraphs
- Complexity of the repeaters allocating problem
- The synchronization problem in protocol testing and its complexity
- DFS-traversing graphs in a paging environment, LRU or MRU!
- An additive bounding procedure for the asymmetric travelling salesman problem
- Maintaining bridge-connected and biconnected components on-line
- A linear-time algorithm for finding an ambitus
- A model classifying algorithms as inherently sequential with applications to graph searching
- A linear time algorithm for computing 3-edge-connected components in a multigraph
- A new fixed point approach for stable networks and stable marriages
- Parallel search algorithms for graphs and trees
- The multicovering problem
- I/O- and CPU-optimal recognition of strongly connected components
- Partitioning, tearing and modification of sparse linear systems
- A new algorithm for finding weak components
- Deriving graphs from graphs by applying a production
- On the vector representation of the reachability in planar directed graphs
- Edge-disjoint spanning trees and depth-first search
- Some properties of a centroid of a free tree
- Testing flow graph reducibility
- An algorithm for finding the transitive closure of a digraph
- On maximally distant spanning trees of a graph
- Computational experiences with some transitive closure algorithms
- Computing an st-numbering
- Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs
- On computing the transitive closure of a relation
- Further results on the Aanderaa-Rosenberg conjecture
- On recognizing graph properties from adjacency matrices
- The Min-Max Spanning Tree Problem and some extensions
- The DT-polynomial approach to discrete time-varying network flow problems
- Algorithms for updating minimal spanning trees
- Cycle detection in critical path networks
This page was built for publication: Depth-First Search and Linear Graph Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5663889)
