Depth-First Search and Linear Graph Algorithms

DOI10.1137/0201010zbMath0251.05107OpenAlexW2118382442WikidataQ55952575 ScholiaQ55952575MaRDI QIDQ5663889

Robert Endre Tarjan

Publication date: 1972

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/385742fffcf113656f0d3cf6c06ef95cb8439dc6

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Search theory (90B40) Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

On computing the 2-vertex-connected components of directed graphs, Strong articulation points and strong bridges in large scale graphs, Polynomial recognition of cluster algebras of finite type, The incremental maintenance of a depth-first-search tree in directed acyclic graphs, A linear time algorithm for finding depth-first spanning trees on trapezoid graphs, Path-based depth-first search for strong and biconnected components, Diagnosability of Petri nets with observation graphs, Simple DFS on the complement of a graph and on partially complemented digraphs, 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, Power optimization in ad hoc wireless network topology control with biconnectivity requirements, A branch-and-bound algorithm for the acyclic partitioning problem, The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement, Solving the team orienteering problem with cutting planes, 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, Synthesis of large dynamic concurrent programs from dynamic specifications, An extended framework for passive asynchronous testing, Toward incremental computation of argumentation semantics: a decomposition-based approach, Domino tilings and related models: Space of configurations of domains with holes, A weight-balanced branching rule for SAT, Problems on cycles and colorings, The balanced traveling salesman problem, A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars, Finding dominators via disjoint set union, Recognition and characterization of chronological interval digraphs, A general label search to investigate classical graph search algorithms, Minimal counterexamples for linear-time probabilistic verification, Efficiently mining \(\delta \)-tolerance closed frequent subgraphs, Finding all maximally-matchable edges in a bipartite graph, Reasoning about visibility, Numerical construction of LISS Lyapunov functions under a small-gain condition, The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\), Sequential and distributed on-the-fly computation of weak tau-confluence, Self-stabilizing algorithm for high service availability in spite of concurrent topology changes in ad hoc mobile networks, A post-improvement procedure for the mixed load school bus routing problem, Scenario based robust line balancing: Computational complexity, GMPLS label space minimization through hypergraph layouts, Finding strong bridges and strong articulation points in linear time, On graphs with no induced subdivision of \(K_4\), Weight constraint programs with evaluable functions, Number of holes in unavoidable sets of partial words. II., The complexity of finding uniform sparsest cuts in various graph classes, Efficient total domination in digraphs, Topological ordering algorithm for LDAG, Disjunctive closures for knowledge compilation, The eigenvectors corresponding to the second eigenvalue of the google matrix and their relation to link spamming, Necessary conditions for the generic global rigidity of frameworks on surfaces, Maximizing entropy over Markov processes, Complexity of fuzzy answer set programming under Łukasiewicz semantics, Growth properties of power-free languages, An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags, Application of auxiliary space preconditioning in field-scale reservoir simulation, Topological sorts on DAGs, Trémaux trees and planarity, Dulmage-Mendelsohn canonical decomposition as a generic pruning technique, An efficient strongly connected components algorithm in the fault tolerant model, Space-efficient biconnected components and recognition of outerplanar graphs, Preprocessing for a map sectorization problem by means of mathematical programming, A decomposition approach for commodity pickup and delivery with time-windows under uncertainty, A note on testing axioms of revealed preference, Computing periodic request functions to speed-up the analysis of non-cyclic task models, Indeterminate strings, prefix arrays \& undirected graphs, Using multiset discrimination to solve language processing problems without hashing, Improved complexity results on \(k\)-coloring \(P_t\)-free graphs, Unique Horn renaming and Unique 2-Satisfiability, Element perturbation problems of optimum spanning trees with two-parameter objectives, An algorithm for finding homogeneous pairs, Downwind numbering: Robust multigrid for convection-diffusion problems, Confluence reduction for Markov automata, Stability analysis of stochastic coupled systems on networks without strong connectedness via hierarchical approach, On robust input design for nonlinear dynamical models, Component-wise incremental LTL model checking, Computing maximal weak and other bisimulations, Exact methods for solving the elementary shortest and longest path problems, State space search nogood learning: online refinement of critical-path dead-end detectors in planning, The geo-graph in practice: creating United States congressional districts from census blocks, On the complexity of strongly connected components in directed hypergraphs, On depth first search trees in \(m\)-out digraphs, Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components, Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games, Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs, Three enhancements for optimization-based bound tightening, Rigorous bounds for polynomial Julia sets, Strip planarity testing for embedded planar graphs, A distributed social choice protocol for combinatorial domains, Block-graph width, Finite resolution dynamics, The extended global cardinality constraint: an empirical survey, Component-based construction of bio-pathway models: the parameter estimation problem, IDD-based model validation of biochemical networks, Decision problems for convex languages, Parallel \(\mathcal H\)-matrix arithmetics on shared memory systems, A linear algorithm for the cutting center of a tree, Recognizing sign solvable graphs, Semi-equilibrium models for paracoherent answer set programs, Computation of Lyapunov functions for systems with multiple local attractors, 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, 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, A characterization of the minimum cycle mean in a digraph, A linear-time algorithm for finding all feedback vertices, Large-scale problem analysis and decomposition theory, A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Optimum tearing in large scale systems and minimum feedback cutsets of a digraph, Locating an absolute center on graphs that are almost trees, Shortest path algorithms for nearly acyclic directed graphs, On the disjunctive set problem, On finding a biconnected spanning planar subgraph with applications to the facilities layout problem, Routing trains through railway stations: Complexity issues, OLDTNF-based evaluation method for handling recursive queries in deductive databases, Symbolic manipulation techniques for model simplification in object-oriented modelling of large scale continuous systems, Algorithms for solving nonlinear dynamic decision models, Uncovering generalized-network structure in matrices, Ordering algorithms for irreducible sparse linear systems, The expected number of pairs of connected nodes: Pair-connected reliability, Sensitivity analysis of an agricultural linear programming model, Solving NP-hard problems in 'almost trees': vertex cover, Well-founded semantics and stratification for ordered logic programs, On finding the strongly connected components in a directed graph, Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs, A linear time algorithm for unique Horn satisfiability, Representing polyhedra: Faces are better than vertices, 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, Complexity of fixed point counting problems in Boolean networks, Graph signal denoising using \(t\)-shrinkage priors, Recognizing graph search trees, The greedy strategy for optimizing the Perron eigenvalue, An optimized sweeping solution method for the three-dimensional sn equations of neutron transport on hexahedral meshes, Beyond the BEST theorem: fast assessment of Eulerian trails, Deciding top-down determinism of regular tree languages, Verification by gambling on program slices, Networks of causal relationships in the U.S. stock market, Fault tolerant depth first search in undirected graphs: simple yet efficient, Relationships between Perron-Frobenius eigenvalue and measurements of loops in networks, Upward planar drawings with three and more slopes, Automata-driven partial order reduction and guided search for LTL model checking, Horseshoe shrinkage methods for Bayesian fusion estimation, Graph searches and their end vertices, Toughness, hamiltonicity and split graphs, A parallel algorithm for GAC filtering of the Alldifferent constraint, Fixed-time pinning synchronization for delayed complex networks under completely intermittent control, Default reasoning using classical logic, Algorithms for dense graphs and networks on the random access computer, The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs, Matrix scaling for large-scale system decomposition, Decomposition of a bidirected graph into strongly connected components and its signed poset structure, A decomposition algorithm for computing income taxes with pass-through entities and its application to the Chilean case, Propositional semantics for disjunctive logic programs, An algorithm for road coloring, Resolving Zeckhauser's paradox, 3-colouring AT-free graphs in polynomial time, Overcoming controllability problems in distributed testing from an input output transition system, Exact \(k\)-component graph learning for image clustering, An efficient implementation of the equilibrium algorithm for housing markets with duplicate houses, Vascular network remodeling via vessel cooption, regression and growth in tumors, On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties, Implementation of the temporal reasoning mechanism in modern intelligent systems, Preimage problems for deterministic finite automata, An algebraic representation of graphs and applications to graph enumeration, Graphs with no \(K_{3,3}\) minor containing a fixed edge, Computation of inverse 1-center location problem on the weighted trapezoid graphs, An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton, Cheating strategies for the Gale-Shapley algorithm with complete preference lists, On some properties of DNA graphs, Naturally submodular digraphs and forbidden digraph configurations, Drawing a tree on parallel lines, Computational complexity of \(k\)-block conjugacy, Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets, Proving the absence of unbounded polymers in rule-based models, Static analysis and stochastic search for reachability problem, Balancing sparse matrices for computing eigenvalues, Symbolic coloured SCC decomposition, Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order, Finding densest \(k\)-connected subgraphs, Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result, Algorithms and conditional lower bounds for planning problems, Construction of simple path graphs in transport networks. II: Analysis of graphs' biconnectivity, A decision procedure and complete axiomatization for projection temporal logic, Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter, Revealed preference theory: an algorithmic outlook, Construction of simple path graphs in transport networks. I: General solutions and examples, Criticality: static profiling for real-time programs, Computing parameters of sequence-based dynamic graphs, Join-reachability problems in directed graphs, Randomized proof-labeling schemes, Direct superbubble detection, A decidable class of planar linear hybrid systems, Permanents, \(\alpha\)-permanents and Sinkhorn balancing, An algorithm for obtaining the chromatic number and an optimal coloring of a graph, A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G, Linear stationary control systems over a Boolean semiring: geometric properties and the isomorphism problem, Graph classes and approximability of the happy set problem, Order- and graph-theoretic investigation of dimensions of finite topological spaces and Alexandroff spaces, Verification of C-detectability using Petri nets, The characteristics of cycle-nodes-ratio and its application to network classification, Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search, Unary algebras without proper subalgebras, Optimal supervisor synthesis for Petri nets with uncontrollable transitions: a bottom-up algorithm, A balanced evacuation algorithm for facilities with multiple exits, Periodically intermittent discrete observation control for synchronization of the general stochastic complex network, Deadlock and WCET analysis of barrier-synchronized concurrent programs, A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph, Approximating the smallest 2-vertex connected spanning subgraph of a directed graph, Optimum ramp design in open pit mines, Hydraulic modelling of closed pipes in loop equations of water distribution networks, New and improved algorithms for unordered tree inclusion, Parallel single-pixel imaging: a general method for direct-global separation and 3D shape reconstruction under strong global illumination, Assur decompositions of direction-length frameworks, Faster algorithms for quantitative verification in bounded treewidth graphs, Analysis of strong and strong periodic detectability of bounded labeled Petri nets, Concurrent disjoint set union, Rotor-routing reachability is easy, chip-firing reachability is hard, Fast verified computation for positive solutions to \(\mathcal{M} \)-tensor multi-linear systems and Perron vectors of a kind of weakly irreducible nonnegative tensors, A new allocation rule for the housing market problem with ties, Isometries of the hypercube: a tool for Boolean regulatory networks analysis, The sum of its parts: analysis of federated Byzantine agreement systems, On the recognition of search trees generated by BFS and DFS, Comprehensive decomposition optimization method for locating key sets of commenters spreading conspiracy theory in complex social networks, Graph-based construction of minimal models, Reduced-order observer design for fault diagnosis of Boolean control networks, The implication problem for functional dependencies and variants of marginal distribution equivalences, A linear-time certifying algorithm for recognizing generalized series-parallel graphs, Structural properties of NFAs and growth rates of nondeterminism measures, A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem, On the orbits of the product of two permutations, Data structures for two-edge connectivity in planar graphs, Improving the results of program analysis by abstract interpretation beyond the decreasing sequence, A distributed ant algorithm for efficiently patrolling a network, Data flow analysis from capability lists, with application to RBAC, Approximation algorithms for classes of graphs excluding single-crossing graphs as minors, Recognition of \(q\)-Horn formulae in linear time, An efficient algorithm for computing bisimulation equivalence, Global exponential synchronization of networked dynamical systems under event-triggered control schemes, On the equivalence of constrained and unconstrained flows, Spanning the spectrum from safety to liveness, Aperiodically intermittent synchronization for switching complex networks dependent on topology structure, An efficient transitive closure algorithm for cyclic digraphs, MudPie: layers in the ball of mud, Characterization of \((m,1)\)-transitive and \((3,2)\)-transitive semi- complete directed graphs, Fully dynamic biconnectivity in graphs, A linear algorithm to decompose inheritance graphs into modules, On bandwidth-2 graphs, Unique satisfiability of Horn sets can be solved in nearly linear time, Extremal eigenproblem for bivalent matrices, A capacitated general routing problem on mixed networks, The partial pinning control strategy for large complex networks, 2-vertex connectivity in directed graphs, Minimal controllability of conjunctive Boolean networks is NP-complete, On renamable Horn and generalized Horn functions, Computing maximal subsemigroups of a finite semigroup, On perfect \(0,\pm 1\) matrices, Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM, An optimal parallel algorithm for planar cycle separators, Decomposition in multidimensional Boolean-optimization problems with sparse matrices, A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem, A column generation approach for the location-routing problem with time windows, A congruence on the semiring of normal tropical matrices, Magic sets revisited, Computing and estimating the volume of the solution space of SMT(LA) constraints, A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach, Multiaspect graphs: algebraic representation and algorithms, On the complexity of monitoring Orchids signatures, and recurrence equations, Outer synchronization of delayed coupled systems on networks without strong connectedness: a hierarchical method, A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid, Sparse certificates for 2-connectivity in directed graphs, Computing generalized de Bruijn sequences, A \(0(| V | \cdot | E |)\) algorithm for maximum matching of graphs, Improved shortest path algorithms for nearly acyclic graphs, Model-checking large structured Markov chains., Automated generation of dynamics-based runtime certificates for high-level control, On biconnected and fragile subgraphs of low diameter, On the minimum local-vertex-connectivity augmentation in graphs, Automated competitive analysis of real-time scheduling with graph games, A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time, An explicit transition system construction approach to LTL satisfiability checking, On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles., Enumeration of idempotents in planar diagram monoids, Graphical requirements for multistationarity in reaction networks and their verification in BioModels, A force-directed algorithm for drawing directed graphs symmetrically, Codiagnosability of discrete event systems revisited: a new necessary and sufficient condition and its applications, On detecting maximal quasi antagonistic communities in signed graphs, Ranking nodes in general networks: a Markov multi-chain approach, Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming, A polynomial algorithm for solving system of inequalities in max-plus algebra, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Computing finite semigroups, A robust two-phase heuristic algorithm for the truck scheduling problem in a resource-constrained crossdock, Conflict-driven answer set solving: from theory to practice, Interval routing in reliability networks, Subeigenvectors and supereigenvectors of fuzzy matrices, Stabilization and control Lyapunov functions for language constrained discrete-time switched linear systems, Monotone bargaining is Nash-solvable, An analogue of Hoffman's circulation conditions for max-balanced flows, Exploiting special structure in a primal-dual path-following algorithm, Short encodings of planar graphs and maps, Sorting, linear time and the satisfiability problem, Solving some combinatorial problems on arrays with one-way dataflow, An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid, Minimization algorithms for sequential transducers, An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs, An improved transitive closure algorithm, A linear algorithm for the number of degree constrained subforests of a tree, An improved algorithm for hierarchical clustering using strong components, Graph-theoretical approach to qualitative solvability of linear systems, The monadic second-order logic of graphs. VIII: Orientations, Coloring graphs with no \(\text{odd-}K_4\), A note on finding the bridges of a graph, A linear time algorithm for the bottleneck biconnected spanning subgraph problem, A transformation which preserves the clique number, A simplified correctness proof for a well-known algorithm computing strongly connected components., Backtracking tactics in the backtrack method for SAT, An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree, Relational depth-first-search with applications, 4-edge-coloring graphs of maximum degree 3 in linear time, Algorithms for transitive closure, Network flow and 2-satisfiability, Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs, A linear-time algorithm for solving the center problem on weighted cactus graphs, An efficient algorithm for solving the homogeneous set sandwich problem, Finding the closed partition of a planar graph, A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs, Independent trees in graphs, Finding all the perfect matchings in bipartite graphs, Safe separators for treewidth, Incorporating bounds from decision diagrams into integer programming, Equilibria for games with combined qualitative and quantitative objectives, Topological graph persistence, Coherence graphs, Smallest bipartite bridge-connectivity augmentation, Schnyder woods for higher genus triangulated surfaces, with applications to encoding, Note on the homogeneous set sandwich problem, The pair completion algorithm for the homogeneous set sandwich problem, \(\Delta \)-list vertex coloring in linear time, An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity, Solving shortest paths efficiently on nearly acyclic directed graphs, An automata-theoretic approach to the word problem for \(\omega\)-terms over R, Counting solutions to binomial complete intersections, On the reduction of Yutsis graphs, A space-efficient algorithm for finding strongly connected components, A model partitioning method based on dynamic decoupling for the efficient simulation of multibody systems, A tie-break model for graph search, A lower bound on the Hamiltonian path completion number of a line graph, An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes, Partitioning multi-edge graphs, A note on locating a central vertex of a 3-cactus graph, A universal table model for categorical databases, The upper envelope of piecewise linear functions: Algorithms and applications, Generalizing the Paige-Tarjan algorithm by abstract interpretation, Graph connectivity, partial words, and a theorem of Fine and Wilf, Feedback vertex set on AT-free graphs, Monotonicity in digraph search problems, Polarity of chordal graphs, Recognition of DFS trees: Sequential and parallel algorithms with refined verifications, Monge and feasibility sequences in general flow problems, Computational complexity to verify the unstability of effectivity function, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, Description and analysis of a bottom-up DFA minimization algorithm, A subclass of Horn CNFs optimally compressible in polynomial time, A computational analysis of the tournament equilibrium set, The square of a block graph, Go with the winners: a general Monte Carlo strategy, Maximizing sharing of protected information, The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm, Exclusive and essential sets of implicates of Boolean functions, A search algorithm for subshift attractors of cellular automata, Reducing the time complexity of testing for local threshold testability, Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming, A double genetic algorithm for the MRCPSP/max, On Lyapunov stability of interconnected nonlinear systems: recursive integration methodology, The bridge-connectivity augmentation problem with a partition constraint, Exact leaf powers, Disjoint cycles intersecting a set of vertices, Execution spaces for simple higher dimensional automata, Deciding regularity of hairpin completions of regular languages in polynomial time, The complexity of asynchronous model based testing, Tracking analysis for general linearly coupled dynamical systems, Causal graphs and structurally restricted planning, Exchange of indivisible goods and indifferences: the top trading absorbing sets mechanisms, Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem, On split-coloring problems, An update algorithm for restricted random walk clustering for dynamic data sets, Finding a feasible flow in a strongly connected network, A general framework for architecture composability, Optimising the ProB model checker for B using partial order reduction, HyPAM: A hybrid continuum-particle model for incompressible free-surface flows, Universal Pareto dominance and welfare for plausible utility functions, 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, Traversing graphs in a paging environment, BFS or DFS?, 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_4\)-sparse graphs, A perfect matching algorithm for sparse bipartite graphs, Connectivity of workflow nets: The foundations of stepwise verification, Disjoint essential sets of implicates of a CQ Horn function, An efficient algorithm to find next-to-shortest path on permutation graphs, From liveness to promptness, Backdoor sets of quantified Boolean formulas, \(L(p,q)\)-label coloring problem with application to channel allocation, Solving the 2-rooted mini-max spanning forest problem by branch-and-bound, Deadlock and liveness characterization for a class of generalized Petri nets, A structural analysis of topic ontologies, A linear-time algorithm for classifying the states of a finite Markov chain, Sur la classification syntaxique, Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones, A parallel search algorithm for directed acyclic graphs, 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, Classes of matrices for the traveling salesman problem, A taxonomy of fairness and temporal logic problems for Petri nets, Improved algorithms for graph four-connectivity, Chain packing in graphs, Efficient polynomial algorithms for distributive lattices, ASSAT: computing answer sets of a logic program by SAT solvers, Checking timed Büchi automata emptiness efficiently, An efficient bounds consistency algorithm for the global cardinality constraint, Binets: fundamental building blocks for phylogenetic networks, Augmenting weighted graphs to establish directed point-to-point connectivity, The Boolean pivot operation, \(M\)-matrices, and reducible matrices, On the core of information graph games, Balancing sparse Hamiltonian eigenproblems, A space-efficient simulation algorithm on probabilistic automata, Randomized parameterized algorithms for the kidney exchange problem, Fast computation of multiphase flow in porous media by implicit discontinuous Galerkin schemes with optimal ordering of elements, The complexity of shelflisting, GLOUDS: representing tree-like graphs, Communication in m-connected graphs, Cascading flowlines and layout modules: Practical strategies for machine duplication in facility layouts, Generalised arc consistency for the AllDifferent constraint: an empirical survey, On finding an ear decomposition of an undirected graph distributively, Extending SMT solvers with support for finite domain \texttt{alldifferent} constraint, Applying clique-decomposition for computing Gromov hyperbolicity, Two-sided matching with indifferences, Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits, A heuristic approach for dividing graphs into bi-connected components with a size constraint, Reachability preserving compression for dynamic graph, Inheritance of convexity for the \(\mathcal{P}_{\min}\)-restricted game, 2-edge-twinless blocks, A general framework for diagnosis of discrete event systems subject to sensor failures, Incremental algorithm for maintaining a DFS tree for undirected graphs, Resilience to denial-of-service and integrity attacks: a structured systems approach, Minimal observability of Boolean control networks, Dijkstra graphs, Model checking with fairness assumptions using PAT, Extremality criteria for the supereigenvector space in max-plus algebra, Long-range connections and mixed diffusion in fractional networks, Computing densest \(k\)-subgraph with structural parameters, Disjunctive fault prediction of decentralized discrete event systems: verification, predictor design and K-copredictability, Probabilistic and exact frequent subtree mining in graphs beyond forests, Near-linear convergence of the random Osborne algorithm for matrix balancing, Irreducibility and extensions of Ostrowski's Theorem, The continuum limit of critical random graphs, Construction of discontinuous piecewise quadratic value functions in a target control problem, A simple certifying algorithm for 3-edge-connectivity, Simple priorities and core stability in hedonic games, Modeling country risk ratings using partial orders, A note on Ostrowski's theorem, Safe typing of functional logic programs with opaque patterns and local bindings, Computational study of the US stock market evolution: a rank correlation-based network model, The vertex leafage of chordal graphs, Morse connection graphs for piecewise constant vector fields on surfaces, Excessively duplicating patterns represent non-regular languages, Directed graphs, decompositions, and spatial linkages, On Brauer-Ostrowski and Brualdi sets, An automatic method for the dynamic construction of abstractions of states of a formal model, Multigraph augmentation under biconnectivity and general edge-connectivity requirements, Map construction of unknown graphs by multiple agents, An incremental algorithm for generating all minimal models, The source location problem with local 3-vertex-connectivity requirements, Symbolic graphs: Linear solutions to connectivity related problems, Efficient algorithms for deciding the type of growth of products of integer matrices, Quantitative methods for ecological network analysis, Dynamical modeling and analysis of large cellular regulatory networks, An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps, On global warming: Flow-based soft global constraints, Augmenting forests to meet odd diameter requirements, Table design in dynamic programming, Distribution of statistics of hidden state sequences through the sum-product algorithm, On the Power of Graph Searching for Cocomparability Graphs, Necessary and sufficient condition for the global stability of a delayed discrete-time single neuron model, Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning, Path-Based Mathematical Morphology on Tensor Fields, Computation of strict minimal siphons in a class of Petri nets based on problem decomposition, Steiner centers and Steiner medians of graphs, Dimension reduction of large sparse AND-NOT network models, A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time, SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs, A doubly nonnegative relaxation for modularity density maximization, Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster, Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles, Stabilizing the Metzler matrices with applications to dynamical systems, On generic semi-simple decomposition of dimension vector for an arbitrary quiver, Inertias of Laplacian matrices of weighted signed graphs, Finding strongly connected components of simple digraphs based on granulation strategy, The spectra of reducible matrices over complete commutative idempotent semifields and their spectral lattices, On Computing the Gromov Hyperbolicity, On some properties of the Laplacian matrix revealed by the RCM algorithm, An algorithm for computing the spectral radius of nonnegative tensors, Space efficient linear time algorithms for BFS, DFS and applications, Evaluating Datalog via tree automata and cycluits, A UNIFIED FRAMEWORK FOR BI(TRI)CONNECTIVITY AND CHORDAL AUGMENTATION, Recomputing causality assignments on lumped process models when adding new simplification assumptions, Logic-based Benders decomposition for scheduling a batching machine, Stochastic stabilization problem of complex networks without strong connectedness, Global rigidity of generic frameworks on the cylinder, More efficient on-the-fly LTL verification with Tarjan's algorithm, Maximally permissive mutually and globally nonblocking supervision with application to switching control, Variations on the bottleneck paths problem, A graph theoretical approach to input design for identification of nonlinear dynamical models, Explaining circuit propagation, Bounds on the disparity and separation of tournament solutions, Multidimensional welfare rankings under weight imprecision: a social choice perspective, A simple 3-edge connected component algorithm revisited, Computing the shortest reset words of synchronizing automata, Computing minimum length representations of sets of words of uniform length, A note on the separation of subtour elimination constraints in elementary shortest path problems, Almost linear Büchi automata, The YAP Prolog system, Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components, 2-Vertex Connectivity in Directed Graphs, Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time, Rooted Cycle Bases, Parameterized Splitting: A Simple Modification-Based Approach, On Nonnegative matrices generating a finite multiplicative monoid, Searching forK_3,3in linear time, SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS, Sparse Matrix Methods for Circuit Simulation Problems, Pole assignment problem: a structural investigation, Preprocessing for DQBF, Automata Theory and Model Checking, Parallel Computation of Nearly Recurrent Components of Piecewise Constant Vector Fields, Unnamed Item, Design of an atomized organization structure: a graph-theoretic approach, Combinatorial Vector Field Topology in Three Dimensions, A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities, Localized Bridging Centrality, Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition, ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS, A Faster Algorithm to Update Betweenness Centrality after Node Alteration, SAT Modulo Graphs: Acyclicity, Modular Paracoherent Answer Sets, Sensitivity analysis of linear systems—a structural approach, Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs, A Fast Greedy Algorithm for the Critical Node Detection Problem, Depth-First Search Using $$O(n)$$ Bits, Computing Minimum Length Representations of Sets of Words of Uniform Length, On Dynamic DFS Tree in Directed Graphs, Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs, A POINT BASIS FOR MULTIVARIABLE PIECEWISE LINEAR INTERPOLATION AND DESIGN CENTERING, On the Number of Synchronizing Colorings of Digraphs, Graph-Based Generation of Referring Expressions, Abductive learning of quantized stochastic processes with probabilistic finite automata, Parameterized Algorithms and Hardness Results for Some Graph Motif Problems, Constrained Min-Cut Replication for K-Way Hypergraph Partitioning, DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC, Local optimization of colorings of graphs, Unnamed Item, When Is Reachability Intrinsically Decidable?, Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order, Genetic Programming and Model Checking: Synthesizing New Mutual Exclusion Algorithms, An 0(log n) parallel algorithm for strong connectivity augmentation problem, An algorithm for finding all thek-components of a digraph, Applications of graph theory in computer systems, Linear Temporal Logic Satisfaction in Adversarial Environments Using Secure Control Barrier Certificates, Emergence of giant strongly connected components in continuum disk-spin percolation, Generalizedk-core pruning process on directed networks, Efficient CNF Simplification Based on Binary Implication Graphs, A search strategy for the elementary cycles of a directed graph, An algorithm for the determination of longest distances in a graph, On modelling and differential/algebraic systems, Phylogenetic Footprinting and Consistent Sets of Local Aligments, A polynomial algorithm for the max-cut problem on graphs without long odd cycles, An algebraic multigrid method for isotropic linear elasticity problems on anisotropic meshes, Parallel breadth-first search algorithms for trees and graphs, A linear time algorithm to construct a tree 4-spanner on trapezoid graphs, Reduktion von Präzedenzstrukturen, A note on the decomposition of systems of sparse non-linear equations, Unnamed Item, On reachability of dynamic systems†, Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages, On pure structure of dynamic systems, Swapping evaluation: A memory-scalable solution for answer-on-demand tabling, FO(FD): Extending classical logic with rule-based fixpoint definitions, The regenerator location problem, Kernelization and complexity results for connectivity augmentation problems, Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search, Minimizing Coordination Channels in Distributed Testing, From Monomorphic to Polymorphic Well-Typings and Beyond, Decompositional Construction of Lyapunov Functions for Hybrid Systems, Indexing Structure for Graph-Structured Data, Reducing the number of adjustments required in an effector, Maximal stability region of a perturbed nonnegative matrix, On the Link between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems, Unnamed Item, Initial Algebra Semantics for Cyclic Sharing Structures, Extracting Winning Strategies in Update Games, An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton, A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing, Towards physics-oriented smoothing in algebraic multigrid for systems of partial differential equations arising in multi-ion transport and reaction models, SWITCHING GRAPHS, Solving Parity Games in Practice, On-the-fly Emptiness Check of Transition-Based Streett Automata, Analysis of program structure, Optimum matching forests I: Special weights, Segment graphs, depth-first cycle bases, 3-connectivity, and planarity of graphs, Finding triconnected components of graphs, DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY, Sparsity in convex quadratic programming with interior point methods, Generating Nonisomorphic Maps without Storing Them, Consensus of multi-agent systems with nonlinear dynamics and sampled-data information: a delayed-input approach, MANAGING TEMPORAL CYCLES IN PLANNING PROBLEMS REQUIRING CONCURRENCY, UN-KLEENE BOOLEAN EQUATION SOLVING, Improved Distributed Algorithms for SCC Decomposition, Linear time algorithms for finding sparsest cuts in various graph classes, Local stability implies global stability for the 2-dimensional Ricker map, Distributed consensus control for linear multi-agent systems with discontinuous observations, A novel discrete particle swarm optimization algorithm for solving bayesian network structures learning problem, Optimal In-place Algorithms for Basic Graph Problems, Unnamed Item, On Eigenproblem for Circulant Matrices in Max-Algebra, Autarkies and Persistencies for QUBO, Minimum 2-vertex strongly biconnected spanning directed subgraph problem, Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning, Multi-level Access Control, Directed Graphs and Partial Orders in Flow Control for Data Secrecy and Privacy, Fully dynamic 2-edge-connectivity in planar graphs, Improved parallel depth-first search in undirected planar graphs, Multi-Valued Reasoning about Reactive Systems, Optimising the multilateral netting of fungible OTC derivatives, Computing Critical Nodes in Directed Graphs, A New Variational Model for Shape Graph Registration with Partial Matching Constraints, Unnamed Item, Unnamed Item, Rigorous computational dynamics in the context of unknown nonlinearities, MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS, Upward planar drawings with two slopes, Bijective comparison of optimal planarity algorithms, Evaluation of Chaotic Properties Of CBC Mode of Encryption Embedded with RC5 Block Cipher Algorithm, A Geometric Approach for Analyzing Parametric Biological Systems by Exploiting Block Triangular Structure, Merging heterogeneous security orderings, Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time, Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory, Computing the well-founded semantics faster, On the impact of stratification on the complexity of nonmonotonic reasoning, Tight Localizations of Feedback Sets, An Exact Method for the Minimum Feedback Arc Set Problem, How well-connected is the surface of the global ocean?, Optimal distributions for multiplex logistic networks, A linear algebraic approach to datalog evaluation, Strong Connectivity in Directed Graphs under Failures, with Applications, Unnamed Item, Shortcutting Planar Digraphs, Making Bipartite Graphs DM-Irreducible, Unnamed Item, Digital Bifurcation Analysis of Internet Congestion Control Protocols, Compact and localized distributed data structures, Qualitative Numeric Planning: Reductions and Complexity, Unnamed Item, An O(¦S¦ × ¦T¦)-algorithm to verify if a net is regular, An optimal algorithm to find minimum k-hop dominating set of interval graphs, Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs., Complexity of Preimage Problems for Deterministic Finite Automata, Symbolic elimination in dynamic optimization based on block-triangular ordering, On path-bridge inequalities for the orienteering arc routing problems, Computing congruence lattices of finite lattices, On the Computational Complexity of Non-Dictatorial Aggregation, Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge, On the index of convergence of a class of Boolean matrices with structural properties, Upper bounds on scrambling index for non-primitive digraphs, Control and simulation of hybrid systems, Non-discriminating Arguments and Their Uses, Rank-Based Symbolic Bisimulation, Graphical methods for analysing feedback in biological networks – A survey, Unnamed Item, UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION, Deadlock Detection in Linear Recursive Programs, A new algorithm for digraph isomorphism, COMBINATORIAL REES–SUSHKEVICH VARIETIES THAT ARE CROSS, FINITELY GENERATED, OR SMALL, The Robot Routing Problem for Collecting Aggregate Stochastic Rewards, A structure theorem for graphs with no cycle with a unique chord and its consequences, On matroids and hierarchical graphs, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, PageRank for networks, graphs, and Markov chains, Geometrical Regular Languages and Linear Diophantine Equations, Computing the Rabin Index of a Parity Automaton, Unnamed Item, Maintenance of triconnected components of graphs, Branching Measures and Nearly Acyclic NFAs, An algorithm for an 𝓁²-homological test for the planarity of a graph, Physically feasible decomposition of Engino® toy models: A graph-theoretic approach, Improved Guarantees for Vertex Sparsification in Planar Graphs, Some theoretical properties of Feng-Schnabel algorithm for block bordered nonlinear systems, Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph, Unnamed Item, Depth First Search in the Semi-streaming Model, Coloring Graphs with Constraints on Connectivity, Minimizing GFG Transition-Based Automata, Unnamed Item, Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction, Switching Graphs, Unnamed Item, An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs, Unnamed Item, A Faster Algorithm to Update Betweenness Centrality After Node Alteration, Efficient Computation of the Large Inductive Dimension Using Order- and Graph-theoretic Means, Stubborn Sets, Frozen Actions, and Fair Testing, Optimum feedback patterns in multivariable control systems, The Recognition Problem of Graph Search Trees, A polynomial-time algorithm for optimal clustering in a special class of {0, l} -matrices, The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1, Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time, Search for a unique incidence matrix of a graph, Minimum r-neighborhood covering set of permutation graphs, A Linear-Time Algorithm for Finding Induced Planar Subgraphs, A scheme for determining vehicle routes based on Arc-based service network design, Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach, Upward Planar Drawings with Three and More Slopes, Coordination tracking of multi‐agent dynamical systems with general linear node dynamics, INVESTIGATION OF DYNAMICAL SYSTEMS USING SYMBOLIC IMAGES: EFFICIENT IMPLEMENTATION AND APPLICATIONS, Robust nonparametric detection of objects in noisy images, Model Checking of Biological Systems, Trémaux Trees and Planarity, All Circuits Enumeration in Macro-Econometric Models, Cycle selections, Partial-order reduction in the weak modal mu-calculus, Managing interruptions in appointment schedules via patient notification, Bipartite synchronization of signed networks via aperiodically intermittent control based on discrete-time state observations, Fixed parameter tractability of a biconnected bottleneck Steiner network problem, A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings, Model and methods to address urban road network problems with disruptions, Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality, Linear‐time algorithms for eliminating claws in graphs, An efficient algorithm for local testability problem of finite state automata, Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs, Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles, Computational Translation Framework Identifies Biochemical Reaction Networks with Special Topologies and Their Long-Term Dynamics, Sequential importance sampling for estimating expectations over the space of perfect matchings, The scaling limit of a critical random directed graph, Reachability Preservers: New Extremal Bounds and Approximation Algorithms, Tree 3-spanners on generalized prisms of graphs, Computation of diameter, radius and center of permutation graphs, Computing a feedback arc set using PageRank, A branch-and-cut algorithm for the balanced traveling salesman problem, Clustering effect of iterative differential and linear trails, Directed graphs and variable selection in large vector autoregressive models, A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity, Mining ℰℒ⊥ Bases with Adaptable Role Depth, Fine-Grained Complexity of Regular Path Queries, Multiway Spectral Graph Partitioning: Cut Functions, Cheeger Inequalities, and a Simple Algorithm, Agglomeration of polygonal grids using graph neural networks with applications to multigrid solvers, Algorithms for recalculating alpha and eigenvector centrality measures using graph partitioning techniques, Uniquely colorable graphs up to automorphisms, Unnamed Item, Shortest paths with exclusive-disjunction arc pairs conflicts, A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem, Unnamed Item, Unnamed Item, Unnamed Item, A theoretical and computational study of green vehicle routing problems, A genetic approach for the 2‐edge‐connected minimum branch vertices problem, District metered area design through multicriteria and multiobjective optimization, An in-reachability based classification of invariant synchrony patterns in weighted coupled cell networks, Effective Computation of a Feedback Arc Set Using PageRank, On 2-strong connectivity orientations of mixed graphs and related problems, A linear delay algorithm for enumeration of 2-edge/vertex-connected induced subgraphs, Taking Some Burden Off an Explicit CTL Model Checker, Asymptotic stability of probabilistic logical networks with random impulsive effects, Anomalous networks under the multispecies coalescent: theory and prevalence, DFS tree construction: Algorithms and characterizations, Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching, Efficient semi-external depth-first search, Prediction of effective elastic moduli of rocks using graph neural networks, $hp$-Adaptive Discontinuous Galerkin Methods for Neutron Transport Criticality Problems, Unnamed Item, Unnamed Item, Unnamed Item, Ordering-based nonlinear solver for fully-implicit simulation of three-phase flow, Inverse source problem in a forced network, Ordering-based nonlinear solver for fully-implicit simulation of three-phase flow, Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction, HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA, Computation of the Euclidean minimum of algebraic number fields, On the graph traversal method for evaluating linear binary-chain programs, A survey of direct methods for sparse linear systems, A fully dynamic algorithm for maintaining the transitive closure, A control theory for Boolean monomial dynamical systems, Polynomial algorithms for canonical forms of orientations, Degree-constrained orientations of embedded graphs, A weakness measure for GR(1) formulae, Optimization and Recognition for K 5-minor Free Graphs in Linear Time, Clique-perfectness of complements of line graphs, On minimal forbidden subgraph characterizations of balanced graphs, Airspace sectorization with constraints, AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY, Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier, Faster algorithms for shortest path and network flow based on graph decomposition, Computing the 2-blocks of directed graphs, Exploiting Structure: Location Problems on Trees and Treelike Graphs, Combinatorial Representation of Parameter Space for Switching Networks, Percolation on the gene regulatory network, A novel algorithm for clearing financial obligations between companies - An application within the Romanian Ministry of economy, Parametric Multi-step Scheme for GPU-Accelerated Graph Decomposition into Strongly Connected Components, Computing 2-twinless blocks, Tree-Based Coarsening and Partitioning of Complex Networks, A direct method for calculating cell cycles of a block map of a simple planar graph