Thepancake problemasks for theminimumnumber of prefix reversals sufficient for sorting any permutation of length n. We improve the upper bound for the pancake problem to (18/11)n+ O(1) ≈ (1.6363)n. © 2008 Elsevier B.V. All rights reserved.

29 RDF graphs to be enhanced by declaring semantic constraints between classes and properties. Such constraints are interpreted under the open-world assumption [2], propagating instances from one relationship to another. For example, in a database where “Océan is a pancake house” and “a pancake house is a restaurant”, we can infer that “Océan is a restaurant”. Querying the database for restaura...

Recently, researches of parallel distributed computation are getting more important. Especially, massively parallel systems are studied with enthusiasm, and many topologies have been proposed. Since multiple faulty elements are expected in a massively parallel system, fault-tolerant routing is also studied eagerly for communication avoiding the faulty elements [4,6,8]. In this study, we focus o...

The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm. The burnt pancake graph is a more complex variant of the pancake graph. In this talk, we examine the properties ...

A burnt pancake graph is a variant of Cayley graphs and its topology is suitable for massively parallel systems. However, for a burnt pancake graph, there is much room for further research. Hence, in this study, we focus on n-burnt pancake graphs and propose an algorithm to obtain n disjoint paths from a source node to n destination nodes in polynomial order time of n, n being the degree of the...

We consider an explosion at the center of a halo which forms at the intersection of filaments inside a cosmological pancake, a convenient test-bed model for galaxy formation. ASPH/PM simulations reveal that such explosions are anisotropic. The energy and metals are channeled into the low density regions, away from the pancake. The pancake remains essentially undisturbed, even if the explosion i...

The pancake problem is concerned with sorting a permutation (a stack of pancakes of different diameter) using only prefix reversals (spatula flips). Although the problem description belies simplicity, an exact formula for the maximum number of flips needed to sort $n$ pancakes has been elusive. In this paper we present a different approach to the pancake problem, as a word problem on the symmet...

The ring structure is important for distributed computing, and it is useful to construct a hamiltonian cycle or rings of various length in the network. Kanevsky and Feng [3] proved that all cycles of length l where 6 ≤ l ≤ n!−2 or l = n! can be embedded in the pancake graphs Gn. Later, Senoussi and Lavault [9] presented the embedding of ring of length l, 3 ≤ l ≤ n!, with dilation 2 in the panca...

The concept of a double-bonded pancake bonding mechanism is introduced to explain the extremely short π-π stacking contacts in dimers of dithiatriazines. While ordinary single pancake bonds occur between radicals and already display significantly shorter interatomic distances in comparison to van der Waals (vdW) contacts, the double-bonded pancake dimer is based on diradicaloid or antiaromatic ...

We present a pangenome data structure (“PanCake”) for sets of related genomes, based on bundling similar sequence regions into shared features, which are derived from genome-wide pairwise sequence alignments. We discuss the design of the data structure, basic operations on it and methods to predict core genomes and singleton regions. In contrast to many other pangenome analysis tools, like EDGA...