 |
| Bøker | Bok |
|
| Bøker | Bok |
 Finding a minimal transitive reduction in a strongly connected digraph within linear time. In: Graph-theoretic concepts in computer science, Proc.  Diagraphs: Theory, Algorithms and Applications - Side 711 av Jørgen Bang-Jensen, Gregory Gutin - 2002 - 754 sider Begrenset visning -
|