Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Dubinsky, Manuel"'
Minimum spanning trees are important tools in the analysis and design of networks. Many practical applications require their computation, ranging from biology and linguistics to economy and telecommunications. The set of cycles of a network has a vec
Externí odkaz:
http://arxiv.org/abs/2404.17428
Spanning trees are fundamental objects in graph theory. The spanning tree set size of an arbitrary graph can be very large. This limitation discourages its analysis. However interesting patterns can emerge in small cases. In this article we introduce
Externí odkaz:
http://arxiv.org/abs/2404.16878
Consider a connected graph $G$ and let $T$ be a spanning tree of $G$. Every edge $e \in G-T$ induces a cycle in $T \cup \{e\}$. The intersection of two distinct such cycles is the set of edges of $T$ that belong to both cycles. The MSTCI problem cons
Externí odkaz:
http://arxiv.org/abs/2301.07643
Consider a connected graph $G$ and let $T$ be a spanning tree of $G$. Every edge $e \in G-T$ induces a cycle in $T \cup \{e\}$. The intersection of two distinct such cycles is the set of edges of $T$ that belong to both cycles. We consider the proble
Externí odkaz:
http://arxiv.org/abs/2102.13193
Autor:
Massri, César, Dubinsky, Manuel
We present a subdivision method to solve systems of congruence equations. This method is inspired in a subdivision method, based on Bernstein forms, to solve systems of polynomial inequalities in several variables and arbitrary degrees. The proposed
Externí odkaz:
http://arxiv.org/abs/1606.09544
Autor:
Massri, Cesar, Dubinsky, Manuel
In this article we give an implementation of the standard algorithm to segment a real algebraic plane curve defined implicitly. Our implementation is efficient and simpler than previous. We use global information to count the number of half-branches
Externí odkaz:
http://arxiv.org/abs/1605.06862
Publikováno v:
In Software Impacts August 2021 9
Publikováno v:
SEDICI (UNLP)
Universidad Nacional de La Plata
instacron:UNLP
Universidad Nacional de La Plata
instacron:UNLP
In this article we present an approach to dynamically validate the usage of software connectors in the context of software architectures. By employing aspect oriented techniques the system execution is monitored in order to obtain an architectural vi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a9670b311cfd596e1caa00cef43aeae9
http://sedici.unlp.edu.ar/handle/10915/135663
http://sedici.unlp.edu.ar/handle/10915/135663
Autor:
Massri, C��sar, Dubinsky, Manuel
We present a subdivision method to solve systems of congruence equations. This method is inspired in a subdivision method, based on Bernstein forms, to solve systems of polynomial inequalities in several variables and arbitrary degrees. The proposed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e344af31b8e8ceb5baeb2f83af29fff