Depth-First Search and Linear Graph Algorithms
From MaRDI portal
Cited in
(only showing first 100 items - show all)- On Nonnegative matrices generating a finite multiplicative monoid
- Vascular network remodeling via vessel cooption, regression and growth in tumors
- Minimal observability of Boolean control networks
- Randomized algorithms for statistical image analysis and site percolation on square lattices
- Routing trains through railway stations: Complexity issues
- Minimizing Coordination Channels in Distributed Testing
- The continuum limit of critical random graphs
- Monotonicity in digraph search problems
- Modeling country risk ratings using partial orders
- A linear-time algorithm for finding induced planar subgraphs
- A transformation which preserves the clique number
- Generalized k-core pruning process on directed networks
- A polynomial algorithm for the max-cut problem on graphs without long odd cycles
- Reachability preserving compression for dynamic graph
- Incorporating bounds from decision diagrams into integer programming
- Equilibria for games with combined qualitative and quantitative objectives
- On the delay time in the enumeration of all simple cycles of a directed graph
- DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY
- Semi-equilibrium models for paracoherent answer set programs
- Computation of Lyapunov functions for systems with multiple local attractors
- Orientations without forbidden patterns on three vertices
- Computation of inverse 1-center location problem on the weighted trapezoid graphs
- On the Number of Synchronizing Colorings of Digraphs
- Trémaux trees and planarity
- A simplified correctness proof for a well-known algorithm computing strongly connected components.
- scientific article; zbMATH DE number 7765396 (Why is no real title available?)
- The subgraph homeomorphism problem
- Agglomeration of polygonal grids using graph neural networks with applications to multigrid solvers
- Backtracking tactics in the backtrack method for SAT
- Reachability games and friends: a journey through the Lens of memory and complexity (invited talk)
- Reduced-order observer design for fault diagnosis of Boolean control networks
- On a computer oriented method of the calculation of the spectrum of the function averaging
- Depth First Search in the Semi-streaming Model
- Information theoretic clustering for coarse-grained modeling of non-equilibrium gas dynamics
- Phylogenetic footprinting and consistent sets of local aligments
- scientific article; zbMATH DE number 7561709 (Why is no real title available?)
- Computing finite semigroups
- A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars
- Finding dominators via disjoint set union
- Minimal counterexamples for linear-time probabilistic verification
- scientific article; zbMATH DE number 7561726 (Why is no real title available?)
- A linear time algorithm for unique Horn satisfiability
- Safe typing of functional logic programs with opaque patterns and local bindings
- Initial Algebra Semantics for Cyclic Sharing Structures
- Subeigenvectors and supereigenvectors of fuzzy matrices
- The geo-graph in practice: creating United States congressional districts from census blocks
- On depth first search trees in \(m\)-out digraphs
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications
- Monge and feasibility sequences in general flow problems
- Trémaux trees and planarity
- scientific article; zbMATH DE number 1154176 (Why is no real title available?)
- Coordination tracking of multi-agent dynamical systems with general linear node dynamics
- From Monomorphic to Polymorphic Well-Typings and Beyond
- Efficient computation of Lyapunov functions for Morse decompositions
- Parameterized complexity of the anchored k-core problem for directed graphs
- A fast algorithm to construct a representation for transversal matroids
- On computing the 2-vertex-connected components of directed graphs
- Block-graph width
- On matroids and hierarchical graphs
- Symbolic manipulation techniques for model simplification in object-oriented modelling of large scale continuous systems
- On graphs with no induced subdivision of \(K_4\)
- -list vertex coloring in linear time
- The implication problem for functional dependencies and variants of marginal distribution equivalences
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs
- An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs
- A faster algorithm to update betweenness centrality after node alteration
- A survey of direct methods for sparse linear systems
- Tight localizations of feedback sets
- Uniquely solvable quadratic Boolean equations
- Topological graph persistence
- A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
- Smallest bipartite bridge-connectivity augmentation
- A decomposition algorithm for multi-terminal network flows
- A subclass of Horn CNFs optimally compressible in polynomial time
- The DT-polynomial approach to discrete time-varying network flow problems
- Linear time algorithms for finding sparsest cuts in various graph classes
- Efficient polynomial algorithms for distributive lattices
- Parameterized splitting: a simple modification-based approach
- Computation of the biclique partition number for graphs with specific blocks
- Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs with special blocks
- Automata theory and model checking
- On the complexity of strongly connected components in directed hypergraphs
- Revealed preference theory: an algorithmic outlook
- Construction of simple path graphs in transport networks. I: General solutions and examples
- Large-scale problem analysis and decomposition theory
- Mining ℰℒ⊥ Bases with Adaptable Role Depth
- Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
- Fine-Grained Complexity of Regular Path Queries
- Multiway Spectral Graph Partitioning: Cut Functions, Cheeger Inequalities, and a Simple Algorithm
- Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery
- On the detection of unstructuredness in flowgraphs
- Optimization and Recognition for K 5-minor Free Graphs in Linear Time
- Merging heterogeneous security orderings
- Unary algebras without proper subalgebras
- A unified framework for bi(tri)connectivity and chordal augmentation
- 4-edge-coloring graphs of maximum degree 3 in linear time
- Real-time monitoring of undirected networks: articulation points, bridges, and connected and biconnected components
- Consensus of multi-agent systems with nonlinear dynamics and sampled-data information: a delayed-input approach
- Parallel computation of nearly recurrent components of piecewise constant vector fields
- Finding all maximally-matchable edges in a bipartite graph
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)
