Edge-disjoint spanning trees and depth-first search
From MaRDI portal
Publication:1217713
DOI10.1007/BF00268499zbMath0307.05104OpenAlexW2032370604WikidataQ56443967 ScholiaQ56443967MaRDI QIDQ1217713
Publication date: 1976
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00268499
Related Items (35)
Strong articulation points and strong bridges in large scale graphs ⋮ Recognizing graph search trees ⋮ Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time ⋮ Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs ⋮ Approximate maximum weight branchings ⋮ Computing Critical Nodes in Directed Graphs ⋮ Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems ⋮ An integer programming approach for the search of discretization orders in distance geometry problems ⋮ Sparse certificates for 2-connectivity in directed graphs ⋮ A linear-time parameterized algorithm for computing the width of a DAG ⋮ Finding dominators via disjoint set union ⋮ Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems ⋮ Tight Localizations of Feedback Sets ⋮ Improving logical flow in English-as-a-foreign-language learner essays by reordering sentences ⋮ Strong Connectivity in Directed Graphs under Failures, with Applications ⋮ Linear-time superbubble identification algorithm for genome assembly ⋮ Finding strong bridges and strong articulation points in linear time ⋮ Interval matrices with Monge property. ⋮ A simplified algorithm computing all \(s-t\) bridges and articulation points ⋮ Computing maximal weak and other bisimulations ⋮ Edge-disjoint spanning trees and the number of maximum state circles of a graph ⋮ Transitions States of Stochastic Chemical Kinetic Systems ⋮ Pebble game algorithms and sparse graphs ⋮ Stochastic task networks -- trading performance for stability ⋮ Directionality of real world networks as predicted by path length in directed and undirected graphs ⋮ A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph ⋮ Rank tests from partially ordered data using importance and MCMC sampling methods ⋮ Edge-disjoint branching in directed multigraphs ⋮ Depth First Search in the Semi-streaming Model ⋮ Tame decompositions and collisions ⋮ The Recognition Problem of Graph Search Trees ⋮ Computing the 2-blocks of directed graphs ⋮ On the recognition of search trees generated by BFS and DFS ⋮ A linear-time algorithm for a special case of disjoint set union ⋮ Safety in \(s\)-\(t\) paths, trails and walks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new algorithm for finding weak components
- A good algorithm for edge-disjoint branching
- Testing flow graph reducibility
- Optimization of LR(k) parsers
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Finding Dominators in Directed Graphs
- Efficiency of a Good But Not Linear Set Union Algorithm
- Matroid intersection algorithms
- A Solution of the Shannon Switching Game
- Minimum partition of a matroid into independent subsets
- Lehmans switching game and a theorem of Tutte and Nash-Williams
- Depth-First Search and Linear Graph Algorithms
- Decomposition of Finite Graphs Into Forests
This page was built for publication: Edge-disjoint spanning trees and depth-first search
