Results 71 to 80 of about 971 (113)
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
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
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
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
A survey of the all-pairs shortest paths problem and its variants in graphs
Acta Universitatis Sapientiae: Informatica, 2016 There has been a great deal of interest in the computation of distances and shortest paths problem in graphs which is one of the central, and most studied, problems in (algorithmic) graph theory.
Udaya Kumar Reddy K. R.
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
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
Matching with Couples: a Multidisciplinary Survey [PDF]
This survey deals with two-sided matching markets where one set of agents (workers/residents) has to be matched with another set of agents (firms/hospitals). We first give a short overview of a selection of classical results.
Flip Klijn, Peter Biro
core