Pages that link to "Item:Q1217713"
From MaRDI portal
The following pages link to Edge-disjoint spanning trees and depth-first search (Q1217713):
Displaying 37 items.
- Strong articulation points and strong bridges in large scale graphs (Q270023) (← links)
- Finding dominators via disjoint set union (Q396673) (← links)
- Finding strong bridges and strong articulation points in linear time (Q443716) (← links)
- Computing maximal weak and other bisimulations (Q510897) (← links)
- Approximate maximum weight branchings (Q845674) (← links)
- Linear-time superbubble identification algorithm for genome assembly (Q897907) (← links)
- A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
- Edge-disjoint branching in directed multigraphs (Q1255784) (← links)
- Sparse certificates for 2-connectivity in directed graphs (Q1676306) (← links)
- Edge-disjoint spanning trees and the number of maximum state circles of a graph (Q1752609) (← links)
- Directionality of real world networks as predicted by path length in directed and undirected graphs (Q1782671) (← links)
- Rank tests from partially ordered data using importance and MCMC sampling methods (Q1790345) (← links)
- Stochastic task networks -- trading performance for stability (Q2011606) (← links)
- A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph (Q2032176) (← links)
- On the recognition of search trees generated by BFS and DFS (Q2087463) (← links)
- Safety in \(s\)-\(t\) paths, trails and walks (Q2118205) (← links)
- Recognizing graph search trees (Q2132337) (← links)
- An integer programming approach for the search of discretization orders in distance geometry problems (Q2174886) (← links)
- Interval matrices with Monge property. (Q2216225) (← links)
- A simplified algorithm computing all \(s-t\) bridges and articulation points (Q2235263) (← links)
- Pebble game algorithms and sparse graphs (Q2476285) (← links)
- A linear-time parameterized algorithm for computing the width of a DAG (Q2672441) (← links)
- Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time (Q3448829) (← links)
- Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs (Q3452820) (← links)
- Computing Critical Nodes in Directed Graphs (Q4555541) (← links)
- The Recognition Problem of Graph Search Trees (Q4997136) (← links)
- Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems (Q5084653) (← links)
- Depth First Search in the Semi-streaming Model (Q5090492) (← links)
- Tight Localizations of Feedback Sets (Q5102049) (← links)
- Strong Connectivity in Directed Graphs under Failures, with Applications (Q5123984) (← links)
- Transitions States of Stochastic Chemical Kinetic Systems (Q5163197) (← links)
- Computing the 2-blocks of directed graphs (Q5501861) (← links)
- Tame decompositions and collisions (Q5925210) (← links)
- Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems (Q6040633) (← links)
- Improving logical flow in English-as-a-foreign-language learner essays by reordering sentences (Q6103679) (← links)
- KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price (Q6548520) (← links)
- Complexity of maker-breaker games on edge sets of graphs (Q6657252) (← links)
