Graph drawing by high-dimensional embedding.
Harel, David, Koren, Yehuda (2004)
Journal of Graph Algorithms and Applications
Similarity:
Harel, David, Koren, Yehuda (2004)
Journal of Graph Algorithms and Applications
Similarity:
Martin Knor, Ľudovít Niepel, Ľubomír Šoltés (1993)
Mathematica Slovaca
Similarity:
Erten, C., Kobourov, S.G., Le, V., Navabi, A. (2005)
Journal of Graph Algorithms and Applications
Similarity:
Eades, Peter, Huang, Lin Mao (2000)
Journal of Graph Algorithms and Applications
Similarity:
Holleis, Paul, Zimmermann, Thomas, Gmach, Daniel (2005)
Journal of Graph Algorithms and Applications
Similarity:
Knor, M., Niepel, L., Olts, L. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Bachl, S., Brandenburg, F.-J., Gmach, D. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Ichiro Hofuku, Kunio Oshima (2013)
International Journal of Applied Mathematics and Computer Science
Similarity:
In web search engines, such as Google, the ranking of a particular keyword is determined by mathematical tools, e.g., Pagerank or Hits. However, as the size of the network increases, it becomes increasingly difficult to use keyword ranking to quickly find the information required by an individual user. One reason for this phenomenon is the interference of superfluous information with the link structure. The World Wide Web can be expressed as an enormous directed graph. The purpose of...
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook (2008)
International Journal of Applied Mathematics and Computer Science
Similarity:
In this paper we study the inference of node and edge replacement graph grammars. We search for frequent subgraphs and then check for an overlap among the instances of the subgraphs in the input graph. If the subgraphs overlap by one node, we propose a node replacement graph grammar production. If the subgraphs overlap by two nodes or two nodes and an edge, we propose an edge replacement graph grammar production. We can also infer a hierarchy of productions by compressing portions of...
Brandes, Ulrik, Kääb, Vanessa, Löh, Andres, Wagner, Dorothea, Willhalm, Thomas (2000)
Journal of Graph Algorithms and Applications
Similarity:
Pavla Kabelíková (2010)
Discussiones Mathematicae Graph Theory
Similarity:
Systems of consistent linear equations with symmetric positive semidefinite matrices arise naturally while solving many scientific and engineering problems. In case of a "floating" static structure, the boundary conditions are not sufficient to prevent its rigid body motions. Traditional solvers based on Cholesky decomposition can be adapted to these systems by recognition of zero rows or columns and also by setting up a well conditioned regular submatrix of the problem...