Results 51 to 60 of about 10,214,423 (243)
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, EarlyView.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
Four‐Dimensional pp‐Wave Lie Groups and Harmonic Curvature
Mathematische Nachrichten, EarlyView.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
Circulant Matrix‐Based Box–Behnken Designs With Economic Run Sizes
Quality and Reliability Engineering International, EarlyView.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
Steiner Distance in Product Networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 For a connected graph $G$ of order at least $2$ and $S\subseteq V(G)$, the \emph{Steiner distance} $d_G(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. Let $n$ and $k$ be two integers with $2\
Yaping Mao, Eddie Cheng, Zhao Wang
doaj +1 more source
Unusual algorithms for lexicographical enumeration [PDF]
, 2000 Using well-known results, we consider algorithms for finding minimal words of given length n in regular and context-free languages. We also show algorithms enumerating the words of given length n of regular and contextfree languages in lexicographical ...
Dömösi Pál
core
The argument structure of change-of-state verbs for lexicographical treatment [PDF]
, 2015 [Abstract] This paper sets out to identify the semantic and syntactic context of change-of-state verbs, taking into account both their argument and syntactic structure, in order to pave the way to the establishment of robust lexicographical criteria in
Conde Noguerol, María Eugenia
core +1 more source
Transactions of the Philological Society, EarlyView.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
Lexicographically ordered trees
Topology and its Applications, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Funk, Will, Lutzer, David J.
openaire +2 more sources
Propagation algorithms for lexicographic ordering constraints
Artificial Intelligence, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alan M. Frisch +4 more
openaire +3 more sources
History, EarlyView.Abstract Participants in Russia's 1825 Decembrist uprising against the Tsarist regime were, quite literally, a case study in French cultural influence upon Russia. This is particularly true as it relates to Russia's emotional cultures. Although this has not, traditionally, been the primary focus of historical analysis of this event (in Soviet or ...
ADAM COKER
wiley +1 more source