Graph drawing in motion.
Friedrich, Carsten, Eades, Peter (2002)
Journal of Graph Algorithms and Applications
Similarity:
Friedrich, Carsten, Eades, Peter (2002)
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...
Martin Knor, Ľudovít Niepel, Ľubomír Šoltés (1993)
Mathematica Slovaca
Similarity:
Knor, M., Niepel, L., Olts, L. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
J. Niedereichholz (1970)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
Similarity:
Harel, David, Koren, Yehuda (2004)
Journal of Graph Algorithms and Applications
Similarity:
Henrik Brosenne, Matthias Homeister, Stephan Waack (2002)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We investigate well-structured graph-driven parity-FBDDs, which strictly generalize the two well-known models parity OBDDs and well-structured graph-driven FBDDs. The first main result is a characterization of the complexity of Boolean functions represented by well-structured graph-driven parity-FBDDs in terms of invariants of the function represented and the graph-ordering used. As a consequence, we derive a lower bound criterion and prove an exponential lower bound for certain linear...
D. M. Cvetković (1975)
Matematički Vesnik
Similarity: