An algorithm for optimum common root functions of two digraphs

DOI10.1016/0012-365X(93)90114-9zbMath0786.05039MaRDI QIDQ688253

Mao-cheng Cai

Publication date: 5 May 1994

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

zbMATH Keywords

coveringpolynomial algorithmarborescencesfinite digraphsroot function

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Restricted covering of digraphs with arborescences
• On two minimax theorems in graph
• Common root functions of two digraphs
• A weighted matroid intersection algorithm

This page was built for publication: An algorithm for optimum common root functions of two digraphs