Sciweavers

1389 search results - page 108 / 278
» Lightweight dependent classes
Sort
View
ACS
2010
14 years 11 months ago
Essentiality and Injectivity
Essentiality is an important notion closely related to injectivity. Depending on a class M of morphisms of a category A, three different types of essentiality are considered in lit...
H. Barzegar, M. Mehdi Ebrahimi, Mojgan Mahmoudi
JGT
2008
107views more  JGT 2008»
14 years 11 months ago
On planar intersection graphs with forbidden subgraphs
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
János Pach, Micha Sharir
JSAT
2008
79views more  JSAT 2008»
14 years 11 months ago
An Extended Semidefinite Relaxation for Satisfiability
This paper proposes a new semidefinite programming relaxation for the satisfiability problem. This relaxation is an extension of previous relaxations arising from the paradigm of ...
Miguel F. Anjos
JGAA
2007
93views more  JGAA 2007»
14 years 11 months ago
Large-Graph Layout Algorithms at Work: An Experimental Study
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
Stefan Hachul, Michael Jünger
EOR
2000
61views more  EOR 2000»
14 years 11 months ago
Replacement-repair policy for multi-state deteriorating products under warranty
In this paper we study a warranty servicing policy for a class of multi-state deteriorating and repairable products. The manufacturer's decision to repair or replace a failed...
Ming J. Zuo, Bin Liu, D. N. P. Murthy