Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Phan, Thi Ha Duong"'
Autor:
Do, Duy Hieu, Phan, Thi Ha Duong
We will present improvements to famous algorithms for community detection, namely Newman's spectral method algorithm and the Louvain algorithm. The Newman algorithm begins by treating the original graph as a single cluster, then repeats the process t
Externí odkaz:
http://arxiv.org/abs/2403.08313
Publikováno v:
Discrete Applied Mathematics 195, 2015
We define a new graph operator, called the weak-factor graph, which comes from the context of complex network modelling. The weak-factor operator is close to the well-known clique-graph operator but it rather operates in terms of bicliques in a multi
Externí odkaz:
http://arxiv.org/abs/2103.04451
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs. However, th
Externí odkaz:
http://arxiv.org/abs/2103.04447
We design two incremental algorithms for computing an inclusion-minimal completion of an arbitrary graph into a cograph. The first one is able to do so while providing an additional property which is crucial in practice to obtain inclusion-minimal co
Externí odkaz:
http://arxiv.org/abs/2001.07765
Linearity and contiguity are two parameters devoted to graph encoding. Linearity is a generalisation of contiguity in the sense that every encoding achieving contiguity $k$ induces an encoding achieving linearity $k$, both encoding having size $\Thet
Externí odkaz:
http://arxiv.org/abs/1803.05414
Publikováno v:
In Discrete Applied Mathematics 15 January 2021 288:138-151
Publikováno v:
Automata 2011, DMTCS : Automata 2011 - 17th International Workshop on Cellular Automata and Discrete Complex Systems, pages 17-28
Sand Pile Models are discrete dynamical systems emphasizing the phenomenon of Self-Organized Criticality. From a configuration composed of a finite number of stacked grains, we apply on every possible positions (in parallel) two grain moving transiti
Externí odkaz:
http://arxiv.org/abs/1207.0654
Autor:
Van Pham, Trung, Phan, Thi Ha Duong
Publikováno v:
European Journal of Combinatorics 34 (2013) pp. 812-832
It is well-known that the class of lattices generated by Chip Firing games (CFGs) is strictly included in the class of upper locally distributive lattices (ULD). However a necessary and sufficient criterion for this class is still an open question. I
Externí odkaz:
http://arxiv.org/abs/1205.6256
Autor:
Latapy, Matthieu, Phan, Thi Ha Duong
Publikováno v:
Discrete Mathematics Vol. 309, No. 6, 2009
In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all partitions of
Externí odkaz:
http://arxiv.org/abs/math/0008020
Autor:
Phan Thi Ha Duong
Publikováno v:
Acta Mathematica Vietnamica. 47:833-845
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ce549630178b28ad04f03e4b2bc804d
https://doi.org/10.1007/s40306-021-00475-6
https://doi.org/10.1007/s40306-021-00475-6