Results 1  10
of
1,644,288
Strong subtournaments of close to regular multipartite tournaments
, 2004
"... If x is a vertex of a digraph D, then we denote by d + (x) and d − (x) the outdegree and the indegree of x, respectively. The global irregularity of a digraph D is defined by ig(D) =max{d + (x),d − (x)}−min{d + (y),d − (y)} over all vertices x and y of D (including x = y). If ig(D) =0,thenD is regul ..."
Abstract
 Add to MetaCart
is regular and if ig(D) ≤ 1, then D is called almost regular. Recently, L. Volkmann and S. Winzen showed that every almost regular cpartite tournament D with c ≥ 5 contains a strongly connected subtournament of order p for every p ∈{3, 4,...,c}. In this paper we will investigate multipartite tournaments
Strong subtournaments of multipartite tournaments
 AUSTRALAS J. COMBIN
, 1999
"... An orientation of a complete graph is a tournament, and an orientation of a complete npartite graph is an npartite tournament. For each n 2:: 4, there exist examples of strongly connected npartite tournament without any strongly connected subtournaments of order p 2:: 4. If D is a digraph, then l ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
show that this result is best possible for n = 4. If in addition, "((D) < 3n/2 6, for an almost regular npartite tournament D with n 2:: 5, then D even contains a strong subtournament of order n.
Almost All Almost Regular cPartite Tournaments with c ≥ 5 Are Vertex Pancyclic
, 1998
"... A tournament is an orientation of a complete graph and a multipartite or cpartite tournament is an orientation of a complete cpartite graph. If D is a digraph, then let d + (x) be the outdgree and d \Gamma (x) the indegree of the vertex x in D. The minimum (maximum) outdegree and the minimum ( ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
. Very recently, the third author proved that all regular cpartite tournaments are vertex pancyclic when c 5, and that all, except possibly a finite number, regular 4partite tournaments are vertex pancyclic. Clearly, in a regular multipartite tournament, each partite set has the same cardinality. As a
Diregular cPartite Tournaments Are VertexPancyclic when c ≥ 5
, 1997
"... In [4] it is conjectured that all diregular cpartite tournaments, with c ≥ 4, are pancyclic. In this paper we show that all diregular cpartite tournaments, with c ≥ 5, are in fact vertexpancyclic. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
In [4] it is conjectured that all diregular cpartite tournaments, with c ≥ 4, are pancyclic. In this paper we show that all diregular cpartite tournaments, with c ≥ 5, are in fact vertexpancyclic.
An almost ideal demand system
 American Economic Review
, 1980
"... prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, noncommercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtai ..."
Abstract

Cited by 600 (0 self)
 Add to MetaCart
prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, noncommercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may
On the Resemblance and Containment of Documents
 In Compression and Complexity of Sequences (SEQUENCES’97
, 1997
"... Given two documents A and B we define two mathematical notions: their resemblance r(A, B)andtheircontainment c(A, B) that seem to capture well the informal notions of "roughly the same" and "roughly contained." The basic idea is to reduce these issues to set intersection probl ..."
Abstract

Cited by 499 (7 self)
 Add to MetaCart
Given two documents A and B we define two mathematical notions: their resemblance r(A, B)andtheircontainment c(A, B) that seem to capture well the informal notions of "roughly the same" and "roughly contained." The basic idea is to reduce these issues to set intersection
Understanding Normal and Impaired Word Reading: Computational Principles in QuasiRegular Domains
 PSYCHOLOGICAL REVIEW
, 1996
"... We develop a connectionist approach to processing in quasiregular domains, as exemplified by English word reading. A consideration of the shortcomings of a previous implementation (Seidenberg & McClelland, 1989, Psych. Rev.) in reading nonwords leads to the development of orthographic and phono ..."
Abstract

Cited by 583 (94 self)
 Add to MetaCart
We develop a connectionist approach to processing in quasiregular domains, as exemplified by English word reading. A consideration of the shortcomings of a previous implementation (Seidenberg & McClelland, 1989, Psych. Rev.) in reading nonwords leads to the development of orthographic
An Overview of the C++ Programming Language
, 1999
"... This overview of C++ presents the key design, programming, and languagetechnical concepts using examples to give the reader a feel for the language. C++ is a generalpurpose programming language with a bias towards systems programming that supports efficient lowlevel computation, data abstraction, ..."
Abstract

Cited by 1766 (15 self)
 Add to MetaCart
This overview of C++ presents the key design, programming, and languagetechnical concepts using examples to give the reader a feel for the language. C++ is a generalpurpose programming language with a bias towards systems programming that supports efficient lowlevel computation, data abstraction
The C Programming Language
, 1988
"... The C programming language was devised in the early 1970s as a system implementation language for the nascent Unix operating system. Derived from the typeless language BCPL, it evolved a type structure; created on a tiny machine as a tool to improve a meager programming environment, it has become on ..."
Abstract

Cited by 1527 (16 self)
 Add to MetaCart
The C programming language was devised in the early 1970s as a system implementation language for the nascent Unix operating system. Derived from the typeless language BCPL, it evolved a type structure; created on a tiny machine as a tool to improve a meager programming environment, it has become
Results 1  10
of
1,644,288