5100 search results - page 789 / 1020 » The Linear Complexity of a Graph |
183
click to vote
DAM
2008
15 years 6 months ago
2008
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). For a fixed directed or undirected graph H and an input graph D, the...
157
click to vote
EOR
2008
15 years 6 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
210
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...
183
click to vote
IJSI
2008
15 years 6 months ago
2008
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as caus...
202
click to vote
RE
2006
Springer
15 years 6 months ago
2006
Springer
Aspect-oriented concepts are currently introduced in all phases of the software development life cycle. However, the complexity of interactions among different aspects and between...