Sciweavers

86 search results - page 8 / 18
» Combinatorics of generalized q-Euler numbers
Sort
View
COMBINATORICS
2006
221views more  COMBINATORICS 2006»
13 years 7 months ago
Kernels of Directed Graph Laplacians
Abstract. Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D - Q, sometimes referred to as the directed Laplacian. ...
John S. Caughman IV, J. J. P. Veerman
CPM
2000
Springer
105views Combinatorics» more  CPM 2000»
13 years 12 months ago
Structural Properties and Tractability Results for Linear Synteny
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...
David Liben-Nowell, Jon M. Kleinberg
COMBINATORICS
1998
89views more  COMBINATORICS 1998»
13 years 7 months ago
Venn Diagrams with Few Vertices
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
Bette Bultena, Frank Ruskey
COCOON
2008
Springer
13 years 9 months ago
A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constrai
When a switching network topology is used for constructing optical cross-connects, as in the circuit switching case, no two routes are allowed to share a link. However, if two rou...
Hung Q. Ngo, Yang Wang 0014, Anh Le
CPM
2000
Springer
143views Combinatorics» more  CPM 2000»
13 years 12 months ago
A Boyer-Moore Type Algorithm for Compressed Pattern Matching
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda...