scientific article
From MaRDI portal
Publication:3972953
zbMath0759.05055MaRDI QIDQ3972953
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (29)
Edge-disjoint odd cycles in 4-edge-connected graphs ⋮ A note on multiflows and treewidth ⋮ Unnamed Item ⋮ On the kernelization of split graph problems ⋮ Finding disjoint paths with related path costs ⋮ Some recent progress and applications in graph minor theory ⋮ Combing a Linkage in an Annulus ⋮ On the complexity of the bilevel minimum spanning tree problem ⋮ Mengerian graphs: characterization and recognition ⋮ The disjoint paths problem in quadratic time ⋮ Unnamed Item ⋮ On shortest disjoint paths in planar graphs ⋮ Single-Sink Multicommodity Flow with Side Constraints ⋮ Subexponential parameterized algorithms ⋮ Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs ⋮ Kernelization of Two Path Searching Problems on Split Graphs ⋮ The extremal function for 3-linked graphs ⋮ Searching for \(f\)-Hamiltonian circuits ⋮ The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs ⋮ General vertex disjoint paths in series-parallel graphs ⋮ Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms ⋮ Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems ⋮ On the computational complexity of closest genome problems ⋮ Routing in Undirected Graphs with Constant Congestion ⋮ New Hardness Results for Routing on Disjoint Paths ⋮ The Directed Disjoint Shortest Paths Problem ⋮ Algorithms and obstructions for linear-width and related search parameters ⋮ \(K_{a,k}\) minors in graphs of bounded tree-width ⋮ Two disjoint negative cycles in a signed graph
This page was built for publication:
