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

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

Journal: :Annals of Physics 2021

Robustness of zero-modes two-dimensional Dirac fermions is examined numerically for the honeycomb lattice in presence Kekulé bond ordering. The split n=0 Landau levels a magnetic field as well generated by topological defects ordering are shown to exhibit anomalous robustness against disorder when chiral symmetry respected.

Journal: :Theor. Comput. Sci. 2007
Hsiao-Fei Liu Kun-Mao Chao

Katriel and Bodlaender [7] modify the algorithm proposed by Alpern et al. [2] for maintaining the topological order of the n nodes of a directed acyclic graph while inserting m edges and prove that their algorithm runs in O(min{m3/2 log n,m + n log n}) time and has an Ω(m) lower bound. In this paper, we give a tight analysis of their algorithm by showing that it runs in time Θ(m + mn log n). Ge...

‎The most challenging task in dealing with Bayesian networks is learning their structure‎. ‎Two classical approaches are often used for learning Bayesian network structure;‎ ‎Constraint-Based method and Score-and-Search-Based one‎. ‎But neither the first nor the second one are completely satisfactory‎. ‎Therefore the heuristic search such as Genetic Alg...

1998
P. K. Chan M. D. F. Schlag

Vertex orderings have been successfully applied to problems in netlist clustering, for system partitioning and layout [2] [20]. We present a vertex ordering construction that encompasses most reasonable graph traversals. Two parameters { an attraction function and a window { provide the means for achieving various graph traversals and addressing particular clustering requirements. We then use d...

2008
Hsiao-Fei Liu Kun-Mao Chao

We present an Õ(n)-time algorithm for maintaining the topological order of a directed acyclic graph with n vertices while inserting m edges. This is an improvement over the previous result of O(n) by Ajwani, Friedrich, and Meyer.

2002
Jiří Očenášek Josef Schwarz

In the last few years there has been a growing interest in the field of Estimation of Distribution Algorithms (EDAs), where crossover and mutation genetic operators are replaced by probability estimation and sampling techniques. The Bayesian Optimization Algorithm incorporates methods for learning Bayesian networks and uses these to model the promising solutions and generate new ones. The aim o...

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

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