Searching for "Upper Bounds on the Number of Hidden Nodes in Sugiyama's Algorithm." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Upper bounds on the number of hidden nodes in the Sugiyama algorithm
by Arne Frick — 1997 — In GD ’96: Proceedings of the Symposium on Graph Drawing, volume 1190 of LNCS
…Upper bounds on the number of hidden nodes in the Sugiyama algorithm Arne Frick 1 Introduction…
Cited by 2 (0 self) – Add To MetaCart

Bibliography
by Abbott And Sarin, J. Geometric Range Searching
…. (1997). Upper bounds on the number of hidden nodes in Sugiyama's algorithm. In Proceedings of the 4th…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB