Covering Directed Graphs by In-Trees

DOI10.1007/978-3-540-69733-6_44zbMath1148.05315OpenAlexW1864130323MaRDI QIDQ3511356

Naoyuki Kamiyama, Naoki Katoh

Publication date: 10 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_44

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

The Minimum Weight In-Tree Cover Problem

Cites Work

• Min-max tree covers of graphs.
• Rooted \(k\)-connections in digraphs
• Covering the edge set of a directed graph with trees
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Approximating the minmax rooted-tree cover in a tree
• A weighted matroid intersection algorithm
• Approximations for minimum and min-max vehicle routing problems
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Covering Directed Graphs by In-Trees