Pages that link to "Item:Q5663889"
From MaRDI portal
The following pages link to Depth-First Search and Linear Graph Algorithms (Q5663889):
Displayed 50 items.
- Parallel \(\mathcal H\)-matrix arithmetics on shared memory systems (Q556636) (← links)
- A linear algorithm for the cutting center of a tree (Q578919) (← links)
- Recognizing sign solvable graphs (Q585223) (← links)
- Domino tilings and related models: Space of configurations of domains with holes (Q596048) (← links)
- A weight-balanced branching rule for SAT (Q597527) (← links)
- Using multiset discrimination to solve language processing problems without hashing (Q673099) (← links)
- Unique Horn renaming and Unique 2-Satisfiability (Q673674) (← links)
- Element perturbation problems of optimum spanning trees with two-parameter objectives (Q674298) (← links)
- An algorithm for finding homogeneous pairs (Q674438) (← links)
- Downwind numbering: Robust multigrid for convection-diffusion problems (Q676145) (← links)
- On depth first search trees in \(m\)-out digraphs (Q684408) (← links)
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications (Q685690) (← links)
- Monge and feasibility sequences in general flow problems (Q686244) (← links)
- Computational complexity to verify the unstability of effectivity function (Q687989) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- Go with the winners: a general Monte Carlo strategy (Q696401) (← links)
- Maximizing sharing of protected information (Q696957) (← links)
- Reducing the time complexity of testing for local threshold testability (Q703505) (← links)
- Traversing graphs in a paging environment, BFS or DFS? (Q751281) (← links)
- A perfect matching algorithm for sparse bipartite graphs (Q759771) (← links)
- A linear-time algorithm for classifying the states of a finite Markov chain (Q787588) (← links)
- Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones (Q794387) (← links)
- A parallel search algorithm for directed acyclic graphs (Q795509) (← links)
- Classes of matrices for the traveling salesman problem (Q804474) (← links)
- A taxonomy of fairness and temporal logic problems for Petri nets (Q805257) (← links)
- Improved algorithms for graph four-connectivity (Q808289) (← links)
- Chain packing in graphs (Q808291) (← links)
- Efficient polynomial algorithms for distributive lattices (Q810071) (← links)
- ASSAT: computing answer sets of a logic program by SAT solvers (Q814607) (← links)
- Checking timed Büchi automata emptiness efficiently (Q816203) (← links)
- An efficient bounds consistency algorithm for the global cardinality constraint (Q816677) (← links)
- Safe separators for treewidth (Q819825) (← links)
- Solving shortest paths efficiently on nearly acyclic directed graphs (Q868945) (← links)
- An automata-theoretic approach to the word problem for \(\omega\)-terms over R (Q868948) (← links)
- Counting solutions to binomial complete intersections (Q870342) (← links)
- On the reduction of Yutsis graphs (Q878649) (← links)
- Partitioning multi-edge graphs (Q911315) (← links)
- A note on locating a central vertex of a 3-cactus graph (Q913638) (← links)
- A universal table model for categorical databases (Q918682) (← links)
- The upper envelope of piecewise linear functions: Algorithms and applications (Q919830) (← links)
- Generalizing the Paige-Tarjan algorithm by abstract interpretation (Q924726) (← links)
- Graph connectivity, partial words, and a theorem of Fine and Wilf (Q924728) (← links)
- Feedback vertex set on AT-free graphs (Q944750) (← links)
- Monotonicity in digraph search problems (Q955030) (← links)
- Polarity of chordal graphs (Q955313) (← links)
- Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem (Q995580) (← links)
- On split-coloring problems (Q995923) (← links)
- Finding a feasible flow in a strongly connected network (Q1003481) (← links)
- HyPAM: A hybrid continuum-particle model for incompressible free-surface flows (Q1005511) (← links)
- Sur la classification syntaxique (Q1051097) (← links)