Results 1  10
of
583,109
The Existence of Homomorphisms to Oriented Cycles
, 1999
"... We discuss the existence of homomorphisms of arbitrary digraphs to a fixed oriented cycle C. Our main result asserts that if the cycle C is unbalanced then a digraph G is homomorphic to C if and only if (1) every oriented path homomorphic to G is also homomorphic to C, and (2) the length of ever ..."
Abstract

Cited by 19 (5 self)
 Add to MetaCart
We discuss the existence of homomorphisms of arbitrary digraphs to a fixed oriented cycle C. Our main result asserts that if the cycle C is unbalanced then a digraph G is homomorphic to C if and only if (1) every oriented path homomorphic to G is also homomorphic to C, and (2) the length
A Validation Of ObjectOriented Design Metrics As Quality Indicators
 IEEE Transactions on Software Engineering
, 1995
"... This paper presents the results of a study conducted at the University of Maryland in which we experimentally investigated the suite of ObjectOriented (OO) design metrics introduced by [Chidamber&Kemerer, 1994]. In order to do this, we assessed these metrics as predictors of faultprone clas ..."
Abstract

Cited by 433 (19 self)
 Add to MetaCart
This paper presents the results of a study conducted at the University of Maryland in which we experimentally investigated the suite of ObjectOriented (OO) design metrics introduced by [Chidamber&Kemerer, 1994]. In order to do this, we assessed these metrics as predictors of fault
A Cambrian framework for the oriented cycle
"... This paper completes the project of constructing combinatorial models (called frameworks) for the exchange graph and gvector fan associated to any exchange matrix B whose Cartan companion is of finite or affine type, using the combinatorics and geometry of Coxetersortable elements and Cambrian lat ..."
Abstract
 Add to MetaCart
lattices/fans. Specifically, we construct a framework in the unique nonacyclic affine case, the cyclically oriented ncycle. In the acyclic affine case, a framework was constructed by combining a copy of the Cambrian fan for B with an antipodal copy of the Cambrian fan for −B. In this paper, we extend
ValueBased Software Engineering
 ACM Software Engineering Notes
, 2003
"... Abstract—This paper provides a definition of the term “software engineering ” and a survey of the current state of the art and likely future trends in the field. The survey covers the technology available in the various phases of the software life cycle—requirements engineering, design, coding, test ..."
Abstract

Cited by 462 (32 self)
 Add to MetaCart
Abstract—This paper provides a definition of the term “software engineering ” and a survey of the current state of the art and likely future trends in the field. The survey covers the technology available in the various phases of the software life cycle—requirements engineering, design, coding
Small oriented cycle double cover of graphs
"... A small oriented cycle double cover (SOCDC) of a bridgeless graph G on n vertices is a collection of at most n1 directed cycles of the symmetric orientation, Gs, of G such that each arc of Gs lies in exactly one of the cycles. It is conjectured that every 2connected graph except two complete graph ..."
Abstract
 Add to MetaCart
A small oriented cycle double cover (SOCDC) of a bridgeless graph G on n vertices is a collection of at most n1 directed cycles of the symmetric orientation, Gs, of G such that each arc of Gs lies in exactly one of the cycles. It is conjectured that every 2connected graph except two complete
Minimum Cost Homomorphism Dichotomy for Oriented Cycles
 Proc. AAIM 2008, Lecture Notes Comput. Sci
"... For digraphs D and H, a mapping f: V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (D) is associated with costs ci(u), i ∈ V (H), then the cost of the homomorphism f is u∈V (D) c f(u)(u). For each fixed digraph H, we have the minimum cos ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
of MinHOM(H) when H is an oriented cycle. We conjecture a dichotomy classification for all digraphs with possible loops. 1
Minimum Cost Homomorphisms to Oriented Cycles with Some Loops
"... For digraphs D and H, a homomorphism of D to H is a mapping f: V (D)→V (H) such that uv ∈ A(D) implies f(u)f(v) ∈ A(H). Suppose D and H are two digraphs, and ci(u), u ∈ V (D), i ∈ V (H), are nonnegative real costs. The cost of the homomorphism f of D to H is ∑ u∈V (D) cf(u)(u). The minimum cost hom ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
HOM(H) when H is an oriented cycle with some loops. Furthermore, we show that this dichotomy is a remarkable progress toward a dichotomy for oriented graphs with some loops.
Insertion sequences
 Microbiol Mol. Biol. Rev
, 1998
"... These include: Receive: RSS Feeds, eTOCs, free email alerts (when new articles cite this article), more» Downloaded from ..."
Abstract

Cited by 426 (3 self)
 Add to MetaCart
These include: Receive: RSS Feeds, eTOCs, free email alerts (when new articles cite this article), more» Downloaded from
A nontrivial upper bound on the threshold bias of the Orientedcycle game
, 2014
"... In the Orientedcycle game, introduced by Bollobás and Szabó, two players, called OMaker and OBreaker, alternately direct edges of Kn. OMaker directs exactly one edge, whereas OBreaker is allowed to direct between one and b edges. OMaker wins if the final tournament contains a directed cycle, othe ..."
Abstract
 Add to MetaCart
In the Orientedcycle game, introduced by Bollobás and Szabó, two players, called OMaker and OBreaker, alternately direct edges of Kn. OMaker directs exactly one edge, whereas OBreaker is allowed to direct between one and b edges. OMaker wins if the final tournament contains a directed cycle
Results 1  10
of
583,109