نتایج جستجو برای: topological ordering algorithm

تعداد نتایج: 845873  

Journal: :International Journal of Networking and Computing 2013

2014
TRUONG Q. BAO BORIS S. MORDUKHOVICH ANTOINE SOUBEYRAN Wataru Takahashi

The paper is devoted to variational analysis of set-valued mappings acting from quasimetric spaces into topological spaces with variable ordering structures. Besides the mathematical novelty, our motivation comes from applications to adaptive dynamical models of behavioral sciences. We develop a unified dynamical approach to variational principles in such settings based on the new minimal point...

Journal: :SIAM J. Matrix Analysis Applications 2006
Patrick Amestoy Xiaoye S. Li Esmond G. Ng

We describe a fill-reducing ordering algorithm for sparse, nonsymmetric LU factorizations, where the pivots are restricted to the diagonal and are selected greedily. The ordering algorithm uses only the structural information. Most of the existing methods are based on some type of symmetrization of the original matrix. Our algorithm exploits the nonsymmetric structure of the given matrix as muc...

Journal: :Physical review. E 2017
Marco A Amaral Matjaž Perc Lucas Wardil Attila Szolnoki Elton J da Silva Júnior Jafferson K L da Silva

''Three is a crowd" is an old proverb that applies as much to social interactions as it does to frustrated configurations in statistical physics models. Accordingly, social relations within a triangle deserve special attention. With this motivation, we explore the impact of topological frustration on the evolutionary dynamics of the snowdrift game on a triangular lattice. This topology provides...

M. GHORBANI, M. JALALI,

Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.

2014
Chun-Hung Liu Robin Thomas

Robertson and Seymour proved that graphs are well-quasi-ordered by the minor relation and the weak immersion relation in the prominent Graph Minors series. That is, given infinitely many graphs, one graph contains another as a minor (or a weak immersion, respectively). However, the topological minor relation does not well-quasi-order graphs. For every positive integer i, let Gi be the graph obt...

2011
BERNHARD HAEUPLER TELIKEPALLI KAVITHA SIDDHARTHA SEN ROBERT E. TARJAN

A preliminary version of this article appeared in Proceedings of the 35th International Colloquium on Automata, Languages, and Programming (ICALP), Reykjavik, Iceland, July 7-11, 2008. Author’s addresses: Bernhard Haeupler, CSAIL, Massachusetts Institute of Technology, Cambridge, MA 02139, United States, [email protected]; work done while the author was a visiting student at Princeton University...

2011
V. Wessels A. K. Gangopadhyay K. K. Sahu R. W. Hyers S. M. Canepari J. R. Rogers M. J. Kramer A. I. Goldman D. Robinson J. W. Lee J. R. Morris K. F. Kelton

V. Wessels,1,6,* A. K. Gangopadhyay,1 K. K. Sahu,1,6 R. W. Hyers,2 S. M. Canepari,2 J. R. Rogers,3 M. J. Kramer,4 A. I. Goldman,4 D. Robinson,4,5 J. W. Lee,7 J. R. Morris,7 and K. F. Kelton1 1Washington University, Department of Physics, St. Louis, Missouri 63130, USA 2University of Massachusetts, Department of Mechanical Engineering, Amherst, Massachusetts 01003, USA 3NASA Marshall Space Fligh...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید