«Методы визуализации информации при помощи графов. Часть 2. Методы визуализации ориентированных и неориентированных графов»
 
Домой Лекции Список литературы Справочник

Список литературы

  A. Frick, A. Ludwig, and H. Mehldau A fast adaptive layout algorithm for undirected graphs // LNCS 894. - Springer-Verlag, 1995. - 388 - 403.
  Coffman E., Graham R. Optimal scheduling for two processor systems // Acta Informatica, 1971 - 1.
  K. J. Pulo. Recursive Space Decomposition in Force-Directed Graph Drawing Algorithms // Australian Symposium on Information Visualization. - , 2001. - 95 - 102.
  [Sugiyama K., Tagawa S., Toda M. Methods for visual understanding of hierarchical system structures // IEEE Transactions on Systems, Man, and Cybernetics, 1981 - SMC-11. - 2.
  Andreas Noack Energy models for graph clustering // J. Graph Algorithms Appl., 2007 - 11. - 2.
  B. Berger and P. W. Shor Approximation algorithms for the maximum acyclic subgraph problem // Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms. - , 1990. - 236 - 243.
  Bastert O., Matuszewski C. Layered Drawings of Digraphs // LNCS 2025. - Springer- Verlag, 2001. - 87 - 120.
  Brandenburg F. J., Himsolt M., Rohrer C. An Experimental Comparison of Force-Directed and Randomized Graph Drawing Methods // LNCS-1027. - Springer-Verlag, 1996. - 76 - 87.
  Brandes U. Drawing on Physical Analogies // LNCS 2025. - Springer- Verlag, 2001. - 71 - 86.
  C. Walshaw A Multilevel Algorithm for Force-Directed Graph Drawing. // LNCS-1984. - Springer, 2001. - 171 - 182.
  D. Harel and Y. Koren. A Fast Multi-scale Method for Drawing Large Graphs. // LNCS-1984. - Springer, 2001. - 183 - 196.
  D. Tunkelang JIGGLE: Java Interactive Graph Layout Environment. // LNCS-1547. - Springer-Verlag,, 1998. - 413 - 422.
  Eades, P.; Lin, X.; Smyth, W. F. A fast and effective heuristic for the feedback arc set problem // Information Processing Letters, - 47.
  Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall,Englewood Cliffs, NJ, 1999.
  J. Barnes and P. Hut. A hierarchical O(N log N) force-calculation algorithm. // Nature , 1986. - 324. - 4. - December .
  J. Quigley, P. Eades FADE: Graph Drawing, Clustering, and Visual Abstraction // LNCS-1984. - Springer, 2001.
  P. Eades, X. Lin, andW. F. Smyth Heuristics for the feedback arc set problem.Technical Report. , 1989.
  P. Gajer and S. Kobourov GRIP: Graph Drawing with Intelligent Placement. // LNCS-1984. - Springer, 2001. - 222 - 228.
  Peter Eades. A heuristic for graph drawing. // Congressus Numerantium,, 1984 - 42.
  R. Hadany and D. Harel. A multi-scale algorithm for drawing graphs nicely. // LNCS-1665. - Springer- Verlag, 1999. - 267 - 277.
  S. Aluru, J. Gustafson, G. M. Prabhu, and F. E. Sevilgen Distribution-Independent Hierarchical Algorithms for the N-body Problem // Journal of Supercomputing, 1998 - 12.
  Евстигнеев В.А., Касьянов В.Н. Графы в программировании: обработка визуализация и применение.. БХВ Петербург, 2003.