Sciweavers

202 search results - page 7 / 41
» Counting Distance Permutations
Sort
View
COMBINATORICS
2007
74views more  COMBINATORICS 2007»
13 years 7 months ago
Statistics on the Multi-Colored Permutation Groups
We define an excedance number for the multi-colored permutation group i.e. the wreath product (Zr1 × · · · × Zrk ) Sn and calculate its multi-distribution with some natural ...
Eli Bagno, Ayelet Butman, David Garber
HEURISTICS
2007
103views more  HEURISTICS 2007»
13 years 7 months ago
Distance measures based on the edit distance for permutation-type representations
In this paper, we develop and discuss several distance measures for permutation type representations of solutions of combinatorial optimisation problems. The problems discussed in...
Kenneth Sörensen
WG
2004
Springer
14 years 1 months ago
Treelike Comparability Graphs: Characterization, Recognition, and Applications
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
Sabine Cornelsen, Gabriele Di Stefano
TELSYS
2002
73views more  TELSYS 2002»
13 years 7 months ago
Avoiding Counting to Infinity in Distance Vector Routing
The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is...
Andreas Schmid, Christoph Steigner