Rooted \(k\)-connections in digraphs

DOI10.1016/j.dam.2008.03.040zbMath1208.05035OpenAlexW2015382802MaRDI QIDQ1025990

András Frank

Publication date: 23 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.03.040

zbMATH Keywords

arborescencesmatroid intersectionconnectivity of digraphs

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (20)

Improved approximation algorithms for minimum cost node-connectivity augmentation problems ⋮ Stronger bounds and faster algorithms for packing in generalized kernel systems ⋮ Survivable network activation problems ⋮ Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design ⋮ Approximating minimum-cost edge-covers of crossing biset-families ⋮ Packing of arborescences with matroid constraints via matroid intersection ⋮ The \(b\)-branching problem in digraphs ⋮ Covering directed graphs by in-trees ⋮ Matroid Intersection under Restricted Oracles ⋮ Covering Directed Graphs by In-Trees ⋮ Unnamed Item ⋮ A Survey on Covering Supermodular Functions ⋮ Leader localization in multi-agent systems subject to failure: a graph-theoretic approach ⋮ Degree constrained node-connectivity problems ⋮ A \(4+\epsilon\) approximation for \(k\)-connected subgraphs ⋮ Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems ⋮ On minimum power connectivity problems ⋮ On rooted \(k\)-connectivity problems in quasi-bipartite digraphs ⋮ Covering Intersecting Bi-set Families under Matroid Constraints ⋮ On rooted \(k\)-connectivity problems in quasi-bipartite digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
• An application of submodular flows
• A good algorithm for edge-disjoint branching
• On two minimax theorems in graph
• Increasing the rooted connectivity of a digraph by one
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On combinatorial structures of line drawings of polyhedra
• On the degrees of the vertices of a directed graph
• Submodular functions and optimization.
• Matroid Intersection
• A weighted matroid intersection algorithm
• Packing rooted directed cuts in a weighted directed graph
• Transversals and matroid partition
• Minimum partition of a matroid into independent subsets
• Decomposition of Finite Graphs Into Forests

This page was built for publication: Rooted \(k\)-connections in digraphs