A polynomial time algorithm for deciding convergent transfer subgraphs in acyclic labeled directed graphs

zbMATH Open0974.68154MaRDI QIDQ2718339

Mohammed Ghriga, Wing Ning Li, Paul Kabore

Publication date: 12 December 2001

Published in: Congressus Numerantium (Search for Journal in Brave)

zbMATH Keywords

transfer decision problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Title not available (Why is that?)

This page was built for publication: A polynomial time algorithm for deciding convergent transfer subgraphs in acyclic labeled directed graphs

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