Depth-First Search and Linear Graph Algorithms
From MaRDI portal
Publication:5663889
Cited in
(only showing first 100 items - show all)- Shortcutting Planar Digraphs
- Symbolic graphs: Linear solutions to connectivity related problems
- A note on the separation of subtour elimination constraints in elementary shortest path problems
- Indeterminate strings, prefix arrays \& undirected graphs
- On modelling and differential/algebraic systems
- Augmenting forests to meet odd diameter requirements
- The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement
- Solving the team orienteering problem with cutting planes
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- The solution of the linear complementarity problem by the matrix analogue of the accelerated overrelaxation iterative method
- Revealed preference test and shortest path problem; graph theoretic structure of the rationalizability test
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
- Universal Pareto dominance and welfare for plausible utility functions
- Description and analysis of a bottom-up DFA minimization algorithm
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding
- Exclusive and essential sets of implicates of Boolean functions
- Map construction of unknown graphs by multiple agents
- How well-connected is the surface of the global Ocean?
- Quantitative methods for ecological network analysis
- A control theory for Boolean monomial dynamical systems
- Numerical construction of LISS Lyapunov functions under a small-gain condition
- Algorithms for dense graphs and networks on the random access computer
- Efficient CNF simplification based on binary implication graphs
- Network flow and 2-satisfiability
- Safe separators for treewidth
- A subclass of Horn CNFs optimally compressible in polynomial time
- A note on testing axioms of revealed preference
- Efficiently mining \(\delta \)-tolerance closed frequent subgraphs
- Inertias of Laplacian matrices of weighted signed graphs
- A distributed social choice protocol for combinatorial domains
- Toughness, hamiltonicity and split graphs
- Reasoning about visibility
- Relationships between Perron-Frobenius eigenvalue and measurements of loops in networks
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
- Computing an st-numbering
- Recognition and characterization of chronological interval digraphs
- Airspace sectorization with constraints
- A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars
- Coherence graphs
- Finding dominators via disjoint set union
- On the power of graph searching for cocomparability graphs
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
- Yet another optimal algorithm for 3-edge-connectivity
- A unified framework for bi(tri)connectivity and chordal augmentation
- Minimal counterexamples for linear-time probabilistic verification
- An extended framework for passive asynchronous testing
- Synthesis of large dynamic concurrent programs from dynamic specifications
- Toward incremental computation of argumentation semantics: a decomposition-based approach
- Short encodings of planar graphs and maps
- Matrix scaling for large-scale system decomposition
- Problems on cycles and colorings
- Consensus of multi-agent systems with nonlinear dynamics and sampled-data information: a delayed-input approach
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
- Ordering algorithms for irreducible sparse linear systems
- An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
- From liveness to promptness
- Sparsity in convex quadratic programming with interior point methods
- On robust input design for nonlinear dynamical models
- An efficient algorithm to find next-to-shortest path on permutation graphs
- Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
- Vascular network remodeling via vessel cooption, regression and growth in tumors
- Exact \(k\)-component graph learning for image clustering
- Diagnosability of Petri nets with observation graphs
- A computational analysis of the tournament equilibrium set
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
- Exchange of indivisible goods and indifferences: the top trading absorbing sets mechanisms
- The continuum limit of critical random graphs
- A double genetic algorithm for the MRCPSP/max
- Distributed consensus control for linear multi-agent systems with discontinuous observations
- Minimization algorithms for sequential transducers
- Simple DFS on the complement of a graph and on partially complemented digraphs
- Efficient total domination in digraphs
- Simple priorities and core stability in hedonic games
- Modeling country risk ratings using partial orders
- Integer programming formulations for the elementary shortest path problem
- A multiobjective distance separation methodology to determine sector-level minimum separation for safe air traffic scenarios
- Disjunctive closures for knowledge compilation
- The monadic second-order logic of graphs. VIII: Orientations
- Generating Nonisomorphic Maps without Storing Them
- The multicovering problem
- A general label search to investigate classical graph search algorithms
- A linear time algorithm for the bottleneck biconnected spanning subgraph problem
- An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs
- A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach
- A fast greedy algorithm for the critical node detection problem
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
- A branch-and-bound algorithm for the acyclic partitioning problem
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements
- Testing flow graph reducibility
- An efficient algorithm for computing bisimulation equivalence
- A linear-time algorithm for solving the center problem on weighted cactus graphs
- Path-based mathematical morphology on tensor fields
- Parameterized splitting: a simple modification-based approach
- Optimization and Recognition for K 5-minor Free Graphs in Linear Time
- On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs
- Improved shortest path algorithms for nearly acyclic graphs
- Graph connectivity, partial words, and a theorem of Fine and Wilf
- Deadlock detection in linear recursive programs
- On recognizing graph properties from adjacency matrices
- Algorithms for transitive closure
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)
