scientific article
From MaRDI portal
Publication:3335786
zbMath0545.05001MaRDI QIDQ3335786
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx) Enumerative combinatorics (05Axx) Designs and configurations (05Bxx)
Related Items (22)
Stochastic monotonicity and realizable monotonicity ⋮ Consistent global checkpoints based on direct dependency tracking ⋮ Low density series expansions for backbone properties of percolation clusters ⋮ B(m,n)=G(m)G(n)/G(m + n)and volume of ann‐dimensional sphere ⋮ Group rings with n-generated ideals ⋮ On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs ⋮ The combinatorics of discrete self-similarity ⋮ On \(k\)-weak orders: Recognition and a tolerance result ⋮ On the (in)security of optimized Stern-like signature schemes ⋮ An expanded table of probability values for rao's spacing test ⋮ Realization and synthesis of reversible functions ⋮ The power of logical clock abstractions ⋮ The fractional weak discrepancy of a partially ordered set ⋮ On greatest common divisor matrices and their applications ⋮ Fast linear-space computations of longest common subsequences ⋮ T-structures, T-functions, and texts ⋮ Five discordant permutations ⋮ A new family of proximity graphs: class cover catch digraphs ⋮ Robust hypothesis tests for independence in community assembly ⋮ Fractional weak discrepancy and interval orders ⋮ The proportion of fixed-point-free elements of a transitive permutation group ⋮ A fast and practical bit-vector algorithm for the longest common subsequence problem
This page was built for publication:
