Results 61 to 70 of about 889 (120)
A Parametric Network Approach for Concepts Hierarchy Generation in Text Corpus
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 The article presents a preflow approach for the parametric maximum flow problem, derived from the rules of constructing concepts hierarchy in text corpus.
Sângeorzan L. S. +2 more
doaj +1 more source
On the Approximation of Laplacian Eigenvalues in Graph Disaggregation
, 2016 Graph disaggregation is a technique used to address the high cost of computation for power law graphs on parallel processors. The few high-degree vertices are broken into multiple small-degree vertices, in order to allow for more efficient computation in
Hu, Xiaozhe +2 more
core +1 more source
On the Classical-Quantum Relation of Constants of Motion
Frontiers in Physics, 2018 Groenewold-Van Hove theorem suggest that is not always possible to transform classical observables into quantum observables (a process known as quantization) in a way that, for all Hamiltonians, the constants of motion are preserved.
Fabian Belmonte +3 more
doaj +1 more source
Decomposition of the Product of Cycles Based on Degree Partition
Discussiones Mathematicae Graph Theory, 2019 The Cartesian product of n cycles is a 2n-regular, 2n-connected and bi- pancyclic graph. Let G be the Cartesian product of n even cycles and let 2n = n1+ n2+ ・ ・ ・ + nkwith k ≥ 2 and ni≥ 2 for each i. We prove that if k = 2, then G can be decomposed into
Borse Y. M., Shaikh S. R.
doaj +1 more source
A Note on Graph Burning of Path Forests [PDF]
Discrete Mathematics & Theoretical Computer ScienceGraph burning is a natural discrete graph algorithm inspired by the spread of social contagion. Despite its simplicity, some open problems remain steadfastly unsolved, notably the burning number conjecture, which says that every connected graph of order $
Ta Sheng Tan, Wen Chean Teh
doaj +1 more source
$2$-polarity and algorithmic aspects of polarity variants on cograph superclasses [PDF]
Discrete Mathematics & Theoretical Computer ScienceA graph $G$ is said to be an $(s, k)$-polar graph if its vertex set admits a partition $(A, B)$ such that $A$ and $B$ induce, respectively, a complete $s$-partite graph and the disjoint union of at most $k$ complete graphs.
Fernando Esteban Contreras-Mendoza +1 more
doaj +1 more source
The agreement distance of rooted phylogenetic networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The minimal number of rooted subtree prune and regraft (rSPR) operations needed to transform one phylogenetic tree into another one induces a metric on phylogenetic trees - the rSPR-distance.
Jonathan Klawitter
doaj +1 more source
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
On the number of pancake stacks requiring four flips to be sorted [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Using existing classification results for the 7- and 8-cycles in the pancake graph, we determine the number of permutations that require 4 pancake flips (prefix reversals) to be sorted.
Saúl A. Blanco +2 more
doaj +1 more source
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