The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings

DOI10.1007/978-3-030-92681-6_26OpenAlexW4205355360MaRDI QIDQ2149881

Shasha Li, Zhenyu Taoqiu, Yongtang Shi, Gregory Gutin, Ran Gu

Publication date: 29 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_26

zbMATH Keywords

out-branchingarc-connectivityarc-disjoint branchingsin-branching

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Parameterized algorithms for non-separating trees and branchings in digraphs
• Decomposing locally semicomplete digraphs into strong spanning subdigraphs
• Edge-disjoint in- and out-branchings in tournaments and related path problems
• On two minimax theorems in graph
• \(k\)-distinct in- and out-branchings in digraphs
• Classes of Directed Graphs
• Arc‐disjoint strong spanning subdigraphs of semicomplete compositions
• Digraphs

This page was built for publication: The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings