An algorithm for optimum common root functions of two digraphs

DOI10.1016/0012-365X(93)90114-9zbMATH Open0786.05039MaRDI QIDQ688253FDOQ688253

Authors: Mao-Cheng Cai 

Publication date: 5 May 1994

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

Recommendations

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

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)

Cites Work

• On two minimax theorems in graph
• A weighted matroid intersection algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Common root functions of two digraphs
• Restricted covering of digraphs with arborescences

Cited In (3)

• An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
• Title not available (Why is that?)
• 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)