Results 291 to 300 of about 804,628 (319)
Some of the next articles are maybe not open access.
2014 IEEE Fourth International Conference on Big Data and Cloud Computing, 2014
In this paper, we propose an efficient algorithm to decompose a directed acyclic graph (DAG) G into a minimized set of node-disjoint chains, which cover all the nodes of G. For any two nodes u and v on a chain, if u is above v then there is a path from u to v in G. The best algorithm for this problem up to now needs O(n3) time, where n is the number of
Yangjun Chen, Yibin Chen
openaire +1 more source
In this paper, we propose an efficient algorithm to decompose a directed acyclic graph (DAG) G into a minimized set of node-disjoint chains, which cover all the nodes of G. For any two nodes u and v on a chain, if u is above v then there is a path from u to v in G. The best algorithm for this problem up to now needs O(n3) time, where n is the number of
Yangjun Chen, Yibin Chen
openaire +1 more source
Journal of Graph Theory, 1987
AbstractThere are several methods for constructing snarks (cubic graphs with chromatic index 4). We study the reverse process of splitting a snark into smaller snarks which compose it. We also introduce the notion of a “prime” snark.
Peter J. Cameron +2 more
openaire +2 more sources
AbstractThere are several methods for constructing snarks (cubic graphs with chromatic index 4). We study the reverse process of splitting a snark into smaller snarks which compose it. We also introduce the notion of a “prime” snark.
Peter J. Cameron +2 more
openaire +2 more sources
Mathematics of the USSR-Sbornik, 1970
Every knot of codimension 2 (smooth, piecewise linear or locally flat) is proved to decompose into a connected sum of a finite number of indecomposable knots. Bibliography: 15 titles.
openaire +2 more sources
Every knot of codimension 2 (smooth, piecewise linear or locally flat) is proved to decompose into a connected sum of a finite number of indecomposable knots. Bibliography: 15 titles.
openaire +2 more sources
Canadian Mathematical Bulletin, 1975
Borsuk has asked whether there exists for each compact metric absolute neighbourhood retract X an integer l (depending only on X) with the property that if X is homotopy equivalent to a cartesian product of more than l spaces than at least one of these spaces is contractible. The answer to this question is still not known.
openaire +2 more sources
Borsuk has asked whether there exists for each compact metric absolute neighbourhood retract X an integer l (depending only on X) with the property that if X is homotopy equivalent to a cartesian product of more than l spaces than at least one of these spaces is contractible. The answer to this question is still not known.
openaire +2 more sources
Computing, 1998
The tangential block decomposition for block-tridiagonal matrices is introduced, which is in many aspects similar to the ones being used in frequency filtering. In opposite to those methods, for the class of model problems this new approach does not use any test vectors for its implementation. Similar to many iterative methods, it needs only bounds for
openaire +1 more source
The tangential block decomposition for block-tridiagonal matrices is introduced, which is in many aspects similar to the ones being used in frequency filtering. In opposite to those methods, for the class of model problems this new approach does not use any test vectors for its implementation. Similar to many iterative methods, it needs only bounds for
openaire +1 more source
Journal of the London Mathematical Society, 1988
It is known [see \textit{S. Wagon}, Can. Math. Bull. 26, 337-340 (1983; Zbl 0486.51013)] that a ball in \({\mathbb{R}}^ n \)cannot be decomposed into m sets (2\(\leq m\leq n)\) that are mutually isometric under rotations and translations of \({\mathbb{R}}^ n.\) The author of the present paper considers some related problems concerning decompositions of
openaire +2 more sources
It is known [see \textit{S. Wagon}, Can. Math. Bull. 26, 337-340 (1983; Zbl 0486.51013)] that a ball in \({\mathbb{R}}^ n \)cannot be decomposed into m sets (2\(\leq m\leq n)\) that are mutually isometric under rotations and translations of \({\mathbb{R}}^ n.\) The author of the present paper considers some related problems concerning decompositions of
openaire +2 more sources
The decomposition of sociology
Academic Questions, 1992Abstract The purpose of this opening chapter is to describe and explain an anomaly: in a period when the fields of social science—from the policy sciences to social planning, from public administration to demography—are expanding, one area, sociology, with a distinguished lineage and tradition, is suffering hard times.
openaire +1 more source
Polar Decomposition And Gauss Decomposition
1994Abstract Every real positive definite symmetric matrix x can be diagonalized, that is, there exist an orthogonal matrix u and a positive diagonal matrix d such that x = udu′. This gives a decomposition of x which we call the polar decomposition because of its similarity to polar coordinates in the plane. Another decomposition of x is the
Jacques Faraut, Adam Korányi
openaire +1 more source
On Decomposition of Generators
SIAM Journal on Control and Optimization, 1978Let $\mathcal{A}$ be the infinitesimal generator of a strongly continuous semigroup on a Banach space $\mathcal{E}$. Two classes of bounded operators $\mathcal{P}$ on $\mathcal{E}$ are introduced for which the operators $\mathcal{A}\mathcal{P}$ and $\mathcal{P}\mathcal{A}$ also generate semigroups on $\mathcal{E}$.
openaire +2 more sources
A Multilinear Singular Value Decomposition
SIAM Journal on Matrix Analysis and Applications, 2000Lieven De Lathauwer, Joos Vandewalle
exaly