Results 11 to 20 of about 47,064 (164)
Approximate cycles count in undirected graphs [PDF]
International Journal of Computational Intelligence Systems, 2014 In social networks, counting the number of different cycle sizes can be used to measure the entropy of the network that represents its robustness. The exact algorithms to compute cycles in a graph can generate exact results but they are not guaranteed to
Maytham Safar +5 more
doaj +1 more source
Efficient CSL Model Checking Using Stratification [PDF]
Logical Methods in Computer Science, 2012 For continuous-time Markov chains, the model-checking problem with respect to continuous-time stochastic logic (CSL) has been introduced and shown to be decidable by Aziz, Sanwal, Singhal and Brayton in 1996.
Lijun Zhang +3 more
doaj +1 more source
A max-flow algorithm for positivity of Littlewood-Richardson coefficients [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Littlewood-Richardson coefficients are the multiplicities in the tensor product decomposition of two irreducible representations of the general linear group $\mathrm{GL}(n,\mathbb{C})$.
Peter Bürgisser, Christian Ikenmeyer
doaj +1 more source
Plantinga-Vegter Algorithm takes Average Polynomial Time [PDF]
Proceedings of the 2019 International Symposium on Symbolic and Algebraic Computation, 2019 We exhibit a condition-based analysis of the adaptive subdivision algorithm due to Plantinga and Vegter. The first complexity analysis of the PV Algorithm is due to Burr, Gao and Tsigaridas who proved a $O\big(2^{τd^{4}\log d}\big)$ worst-case cost bound for degree $d$ plane curves with maximum coefficient bit-size $τ$.
Cucker, Felipe +2 more
openaire +2 more sources
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement [PDF]
Journal of Computer and System Sciences, 2015 The Outerplanar Diameter Improvement problem asks, given a graph $G$ and an integer $D$, whether it is possible to add edges to $G$ in a way that the resulting graph is outerplanar and has diameter at most $D$. We provide a dynamic programming algorithm that solves this problem in polynomial time.
Cohen, N. +6 more
openaire +4 more sources
Polynomial Time Algorithms for Tracking Path Problems [PDF]
Algorithmica, 2020 AbstractGiven a graphG, and terminal verticessandt, theTracking Pathsproblem asks to compute a set of minimum number of vertices to be marked as trackers, such that the sequence of trackers encountered in each$$s$$s-$$t$$tpath is unique.Tracking PathsisNP-hard in both directed and undirected graphs in general.
openaire +4 more sources
Polynomial-time algorithms for quadratic isomorphism of polynomials: The regular case [PDF]
Journal of Complexity, 2015 Published in Journal of Complexity, Elsevier, 2015, pp ...
Berthomieu, Jérémy +2 more
openaire +3 more sources
Polynomial time algorithm for solving cyclic games [PDF]
Computer Science Journal of Moldova, 2003 The problem of finding the value and optimal strategies of players in cyclic games is studied. A polynomial time algorithm for solving cyclic games is proposed.
Dmitrii Lozovanu
doaj
IEEE Access, 2020 In the context of chaotic secure communication, this paper is concerned with the predefined-time polynomial-function-based synchronization of chaotic systems via sliding mode control.
Qiaoping Li, Chao Yue
doaj +1 more source
Journal of Mathematical Cryptology, 2022 We investigate the problem of recovering integer inputs (up to an affine scaling) when given only the integer monotonic polynomial outputs. Given nn integer outputs of a degree-dd integer monotonic polynomial whose coefficients and inputs are integers ...
Vivek Srinivas +2 more
doaj +1 more source