Canadian Journal of Mathematics
SCOPUS (1994,1996-2023)SCIE-ISI
0008-414X
1496-4279
Canada
Cơ quản chủ quản: CAMBRIDGE UNIV PRESS , Canadian Mathematical Society
Lĩnh vực:
Mathematics (miscellaneous)
Các bài báo tiêu biểu
Maximal Flow Through a NetworkIntroduction. The problem discussed in this paper was formulated by T. Harris as follows: “Consider a rail network connecting two cities by way of a number of intermediate cities, where each link of the network has a number assigned to it representing its capacity. Assuming a steady state condition, find a maximal flow from one given city to the other.”
Tập 8 - Trang 399-404 - 1956
Paths, Trees, and FlowersA graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertices, called the end-points of the edge. An edge is said to join its end-p... ...
Tập 17 - Trang 449-467 - 1965
A Characterization of Comparability Graphs and of Interval GraphsLet < be a non-reflexive partial ordering defined on a set P . Let G (P , <) be the undirected graph whose vertices are the elements of P , and whose edges (a , b ) connect vertices for which either a &l... ...
Tập 16 - Trang 539-548 - 1964
The Relaxation Method for Linear InequalitiesIn various numerical problems one is confronted with the task of solving a system of linear inequalities: (1.1)
Tập 6 - Trang 382-392 - 1954
The Relaxation Method for Linear InequalitiesLet A be a closed set of points in the n-dimensional euclidean space En . If p and p 1 are points of En such that 1.1
Tập 6 - Trang 393-404 - 1954
The Representation of a Graph by Set IntersectionsGeometrically, a graph is a collection of points (or vertices) together with a set of edges (or curves) each of which joins two distinct vertices of the graph, and no two of which have points in common except possibly end points. Two given vertices of the graph may be joined by no edge or one edge, but may not be joined by more than one edge. From an abstract point of view, a graph ...
Tập 18 - Trang 106-112 - 1966
Canonical Extensions of Harish-Chandra Modules to Representations of GLet G be the group of R-rational points on a reductive, Zariskiconnected, algebraic group defined over R, let K be a maximal compact subgroup, and let g be the corresponding complexified Lie algebra of G. It is a curious fault of the current representation theory of G that for technical reasons one very rarely works with representations... ...
Tập 41 Số 3 - Trang 385-438 - 1989
Comma-Free CodesLet n be a fixed positive integer, and consider an
alphabet consisting of the numbers 1, 2, … , n . With
this alphabet form all possible k -letter words
(a
1
a... ...
Tập 10 - Trang 202-209 - 1958
Some Results on v-Multiplication RingsA family Ω of valuations of the field K is said to be of finite character if only a finite number of valuations are non-zero at any non-zero element of K. If w ∈ Ω has ring A = ∩w∈Ω defined by Ω and hiện toàn bộ
Tập 19 - Trang 710-722 - 1967
On the Decomposition of a Representation of SOn When Restricted to SOn-1Let k be a local field, with char(k ) ≠ 2. A quadratic space V over k is a finite dimensional vector space together with a non-degenerate quadratic form Q: V → k. The special orthogonal group SO(V ) consist...
Tập 44 Số 5 - Trang 974-1002 - 1992