Søk Bilder Maps Play YouTube Nyheter Gmail Disk Mer »
Logg på
Bøker Bok 11 av 1Finding a minimal transitive reduction in a strongly connected digraph within linear...
" 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 - Om denne boken

Graph-Theoretic Concepts in Computer Science: 15th International ..., Volum 15

Manfred Nagl - 1990 - 372 sider
...partial k-trees. Report R-MATH-03/87, Karl-Weierstrass-Institut Fur Mathematik, Berlin, GDR, 1987. Finding a Minimal Transitive Reduction in a Strongly Connected Digraph within Linear Time Klaus Simon ETH Zurich, Institut fur Theoretische Informatik, CH-8092 Zurich, e-mail: simon@inf.ethz.ch...
Begrenset visning - Om denne boken




  1. Mitt bibliotek
  2. Hjelp
  3. Avansert boksøk