Algorithms for Junctions in Acyclic Digraphs

DOI10.1007/978-3-642-38189-8_8zbMath1317.05184OpenAlexW46766408MaRDI QIDQ5265169

Álvaro J. P. Franco, Carlos E. Ferreira

Publication date: 22 July 2015

Published in: Facets of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38189-8_8

zbMATH Keywords

genealogypath problem

Mathematics Subject Classification ID

Applications of graph theory (05C90) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

A min-max relation in flowgraphs ⋮ A \(\min\)-\(\max\) relation in flowgraphs and some applications

This page was built for publication: Algorithms for Junctions in Acyclic Digraphs