scientific article
From MaRDI portal
Publication:2768327
zbMath0987.05090MaRDI QIDQ2768327
Publication date: 30 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (19)
An algorithmic metatheorem for directed treewidth ⋮ Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs ⋮ Approximating Transitive Reductions for Directed Networks ⋮ An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph ⋮ Sparse certificates for 2-connectivity in directed graphs ⋮ Dual power assignment via second Hamiltonian cycle ⋮ An ETH-tight algorithm for bidirected Steiner connectivity ⋮ Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs ⋮ Capacity-preserving subgraphs of directed flow networks ⋮ A \(4+\epsilon\) approximation for \(k\)-connected subgraphs ⋮ Directed hypergraphs: introduction and fundamental algorithms -- a survey ⋮ Approximation algorithms for constructing some required structures in digraphs ⋮ Dual-based approximation algorithms for cut-based network connectivity problems ⋮ 1.61-approximation for min-power strong connectivity with two power levels ⋮ The minimum spanning strong subdigraph problem is fixed parameter tractable ⋮ A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem ⋮ Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Strongly Connected Spanning Subgraph for Almost Symmetric Networks
This page was built for publication:
