Congressus Numerantium, Volume 75Utilitas Mathematica Pub. Incorporated, 1970 - Combinatorial analysis |
From inside the book
Results 1-3 of 9
Page 71
Polynomial Algorithms to Count Linear Extensions in Certain Posets George Steiner * Management Science and Information Systems Area Faculty of Business McMaster University Hamilton , Ontario , Canada Abstract Counting the linear fields ...
Polynomial Algorithms to Count Linear Extensions in Certain Posets George Steiner * Management Science and Information Systems Area Faculty of Business McMaster University Hamilton , Ontario , Canada Abstract Counting the linear fields ...
Page 73
... linear extensions of trees . For all these posets we present polynomial time algorithms to count the linear extensions in which an element has fixed rank or in which the relationship between two elements is fixed ( e.g. x is always ...
... linear extensions of trees . For all these posets we present polynomial time algorithms to count the linear extensions in which an element has fixed rank or in which the relationship between two elements is fixed ( e.g. x is always ...
Page 76
... linear extensions for a PeBW Thus based on ( 2 ) we have Corollary 2. The number of constrained mergings of the ... linear extensions of P in which x precedes y . Then pr ( P : x < y ) e ( P : x < y ) / e ( P ) is the fraction of ...
... linear extensions for a PeBW Thus based on ( 2 ) we have Corollary 2. The number of constrained mergings of the ... linear extensions of P in which x precedes y . Then pr ( P : x < y ) e ( P : x < y ) / e ( P ) is the fraction of ...
Other editions - View all
Common terms and phrases
adjacency algebra adjacency matrices affine plane applications best approximation C.B. DUNHAM cellular automata characteristic polynomial check bit coherent color companion matrix complex Hadamard matrix computation configuration consider constructed Corollary decomposition defined denote edge-graceful edge-graceful labeling elements equations error example exists F(Ao fi(x Figure finite field finite linear space full-classes function given graph Hadamard matrices Hamiltonian cycle input interactions isomorphism Lemma LFSR linear space log g(n LU decomposition Lyndon words Math matrix of order meeting mod nk multiple node nonconcurrent obtained output P₁ Padé parallel participants partition paths plane of order points poset presence lattice problem processor product terms projective plane Proof regular complex Hadamard relation algebra Remez algorithm row sum satisfy sequence solution Stormer's method subset Technique Theorem theory trial alternant unordered values vector vertex labels vertices