Bounded-degree rooted tree and TDI-ness
From MaRDI portal
Publication:5104597
DOI10.1051/ro/2022101zbMath1497.05039OpenAlexW4282919791MaRDI QIDQ5104597
Jin-Hua Zhao, Hervé L. M. Kerivin
Publication date: 15 September 2022
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2022101
Trees (05C05) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Combinatorics in computer science (68R05) Graph algorithms (graph-theoretic aspects) (05C85) General topics in the theory of algorithms (68W01)
This page was built for publication: Bounded-degree rooted tree and TDI-ness