384 search results - page 25 / 77 » On s-hamiltonian-connected line graphs |
ESA
2007
Springer
14 years 15 days ago
2007
Springer
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
DM
2010
13 years 8 months ago
2010
A 2-cover is a multiset of subsets of [n] := {1, 2, . . . , n} such that each element of [n] lies in exactly two of the subsets. A 2-cover is called proper if all of the subsets o...
BMCBI
2004
13 years 8 months ago
2004
Background: Many real networks can be understood as two complementary networks with two kind of nodes. This is the case of metabolic networks where the first network has chemical ...
DAM
2010
13 years 8 months ago
2010
An equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a graph G is the minimum number of equivalence subgraphs needed to cover the edges of G. W...
MOBICOM
2006
ACM
14 years 2 months ago
2006
ACM
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...