scientific article; zbMATH DE number 219269
From MaRDI portal
Publication:4694756
zbMath0768.68180MaRDI QIDQ4694756
Publication date: 29 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmdirected graphtransitive closuredepth-first searchlinear timestrongly connected digraphminimal transitive reduction
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
On the calculation of transitive reduction-closure of orders ⋮ The minimum spanning strong subdigraph problem is fixed parameter tractable ⋮ The diameter of the stable marriage polytope: bounding from below ⋮ Polyhedral Aspects of Stable Marriage
This page was built for publication: