Results 51 to 60 of about 3,681 (231)
A Coarse Geometric Approach to Graph Layout Problems
ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
Symbol ratio minimax sequences in the lexicographic order
Consider the space of sequences of letters ordered lexicographically. We study the set of all maximal sequences for which the asymptotic proportions of the letters are prescribed, where a sequence is said to be maximal if it is at least as great as ...
Boyland, P, de Carvalho, A, Hall, T
core +1 more source
Four‐Dimensional pp‐Wave Lie Groups and Harmonic Curvature
ABSTRACT We determine all four‐dimensional Lie groups which have harmonic curvature. In parallel, a description of four‐dimensional pp‐wave Lie groups is obtained.
E. García‐Río +2 more
wiley +1 more source
Orientable -distance magic regular graphs
Hefetz, Mütze, and Schwartz conjectured that every connected undirected graph admits an antimagic orientation (Hefetz et al., 2010). In this paper we support the analogous question for distance magic labeling. Let be an Abelian group of order .
Paweł Dyrlaga, Karolina Szopa
doaj +1 more source
Circulant Matrix‐Based Box–Behnken Designs With Economic Run Sizes
ABSTRACT We introduce Circulant Matrix‐Based Box–Behnken Designs (CBBDs), a new class of three‐level, second‐order response surface designs constructed using circulant matrix structures. These designs satisfy an enhanced orthogonal minimally aliased (OMA∗${\rm OMA}^*$) property: they retain the classical OMA property—where main effects are orthogonal ...
Tung‐Dinh Pham, Nam‐Ky Nguyen
wiley +1 more source
Korrektur og retning som leksikografiske funktioner
Thousands of people, in private or public companies and institutions, are daily engaged in text revision or marking. These people frequently run into problems of different types which can be solved by means of dictionary consultation.
Sven Tarp
doaj +1 more source
Kruskal's Tree Theorem for Acyclic Term Graphs [PDF]
In this paper we study termination of term graph rewriting, where we restrict our attention to acyclic term graphs. Motivated by earlier work by Plump we aim at a definition of the notion of simplification order for acyclic term graphs. For this we adapt
Georg Moser, Maria A. Schett
doaj +1 more source
Lexicographically ordered trees
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Funk, Will, Lutzer, David J.
openaire +2 more sources
Abstract Based on an analysis of the Old Literary Tibetan corpus—a corpus of the oldest documented Tibetic language—the present study provides evidence that literary Tibetan v3 verb stems (commonly termed ‘future’) initially encoded passive voice. New arguments put forward in this article range from Trans‐Himalayan nominal morphology to early Tibetan ...
Joanna Bialek
wiley +1 more source
Generating all maximal independent sets on trees in lexicographic order
[[abstract]]An algorithm to generate all maximal independent sets in lexicographic order with polynomial time delay between the output of two successive independent sets was proposed by Johnson.
CHANG YH;WANG JS,;LEE RCT
core +2 more sources

