An algorithm for optimum common root functions of two digraphs

DOI10.1016/0012-365X(93)90114-9MaRDI QIDQ688253zbMATHFDO

Authors Mao-Cheng Cai

Publication date 5 May 1994

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

coveringpolynomial algorithmfinite digraphsroot functionarborescences

Mathematics Subject Classification ID

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

Recommendations

• Common root functions of two digraphs
• scientific article; zbMATH DE number 4212101
• Restricted covering of digraphs with arborescences

Cites work

• scientific article; zbMATH DE number 4212101 (Why is no real title available?)
• scientific article; zbMATH DE number 3904606 (Why is no real title available?)
• A weighted matroid intersection algorithm
• Common root functions of two digraphs
• On two minimax theorems in graph
• Restricted covering of digraphs with arborescences

Cited in

(3)

• scientific article; zbMATH DE number 4185647 (Why is no real title available?)
• An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
• Common root functions of two digraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688253)