Results 71 to 80 of about 864 (107)
Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion [PDF]
, 1999 A number of results in Hamiltonian graph theory are of the form $\mathcal{P}$$_{1}$ implies $\mathcal{P}$$_{2}$, where $\mathcal{P}$$_{1}$ is a property of graphs that is NP-hard and $\mathcal{P}$$_{2}$ is a cycle structure property of graphs that is ...
Bauer, D. +3 more
core +2 more sources
Shrub-depth: Capturing Height of Dense Graphs [PDF]
Logical Methods in Computer Science, 2019 The recent increase of interest in the graph invariant called tree-depth and in its applications in algorithms and logic on graphs led to a natural question: is there an analogously useful "depth" notion also for dense graphs (say; one which is stable ...
Robert Ganian +4 more
doaj +1 more source
Finite-dimensional Zinbiel algebras and combinatorial structures
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022 In this paper, we study the link between finite-dimensional Zinbiel algebras and combinatorial structures or (pseudo)digraphs determining which configurations are associated with those algebras.
Ceballos Manuel +2 more
doaj +1 more source
Sombor index of zero-divisor graphs of commutative rings
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022 In this paper, we investigate the Sombor index of the zero-divisor graph of ℤn which is denoted by Γ(ℤn) for n ∈ {pα, pq, p2q, pqr} where p, q and r are distinct prime numbers. Moreover, we introduce an algorithm which calculates the Sombor index of Γ(ℤn)
Gürsoy Arif +2 more
doaj +1 more source
Complex of abstract cubes and median problem [PDF]
Computer Science Journal of Moldova, 2011 In this paper a special complex $\mathcal{K}^{n}$ of abstract cubes [2, 3], which contains only $n$-dimensional cubes is examined. The border of this complex is an abstract $(n-1)$-dimensional sphere.
Sergiu Cataranciuc, Petru Soltan
doaj
Optimizing compatible sets in wireless networks through integer programming
EURO Journal on Computational Optimization, 2014 In wireless networks, the notion of compatible set refers to a set of radio links that can be simultaneously active with a tolerable interference. Finding a compatible set with maximum weighted revenue from the parallel transmissions is an important ...
Yuan Li +3 more
doaj +1 more source
Eccentricity of Networks with Structural Constraints
Discussiones Mathematicae Graph Theory, 2020 The eccentricity of a node v in a network is the maximum distance from v to any other node. In social networks, the reciprocal of eccentricity is used as a measure of the importance of a node within a network.
Krnc Matjaž +3 more
doaj +1 more source
Measuring Generalized Preferential Attachment in Dynamic Social Networks
, 2005 The mechanism of preferential attachment underpins most recent social network formation models. Yet few authors attempt to check or quantify assumptions on this mechanism.
Roth, Camille
core +4 more sources
Isotopic Equivalence from Bezier Curve Subdivision [PDF]
, 2013 We prove that the control polygon of a Bezier curve B becomes homeomorphic and ambient isotopic to B via subdivision, and we provide closed-form formulas to compute the number of iterations to ensure these topological characteristics.
Li, J., Peters, T. J ., Roulier, J. A.
core
ORTHOGONAL TRACE-SUM MAXIMIZATION: TIGHTNESS OF THE SEMIDEFINITE RELAXATION AND GUARANTEE OF LOCALLY OPTIMAL SOLUTIONS. [PDF]
SIAM J Optim, 2022 Won JH, Zhang T, Zhou H.
europepmc +1 more source