scientific article
From MaRDI portal
Publication:3682487
zbMath0567.05002MaRDI QIDQ3682487
Matthias F. M. Stallmann, Harold N. Gabow
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
minimum spanning treeedge-disjoint spanning treesalgorithm for matroid intersectiongraphic matroid parityshortest pairs of disjoint paths in a network
Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (17)
On Finding Hamiltonian Cycles in Barnette Graphs ⋮ An augmenting path algorithm for linear matroid parity ⋮ On-line updating of solutions to a class of matroid intersection problems ⋮ On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition ⋮ Fully Dynamic Transitive Closure in plane dags with one source and one sink ⋮ An improved algorithm for finding maximum outerplanar subgraphs ⋮ Graph ear decompositions and graph embeddings ⋮ Finding large planar subgraphs and large subgraphs of a given genus ⋮ Forests, frames, and games: Algorithms for matroid sums and applications ⋮ Faster deterministic \textsc{Feedback Vertex Set} ⋮ Spanning trees of 3-uniform hypergraphs ⋮ An orientation theorem with parity conditions ⋮ Algebraic Algorithms for Linear Matroid Parity Problems ⋮ 1.61-approximation for min-power strong connectivity with two power levels ⋮ Local search for the minimum label spanning tree problem with bounded color classes. ⋮ Bidirectional retracting-free double tracings and upper embeddability of graphs ⋮ Exact and approximation algorithms for weighted matroid intersection
This page was built for publication:
