Sciweavers

3204 search results - page 102 / 641
» The Alcuin Number of a Graph
Sort
View
WABI
2010
Springer
124views Bioinformatics» more  WABI 2010»
13 years 6 months ago
Improved Orientations of Physical Networks
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
Iftah Gamzu, Danny Segev, Roded Sharan
ICALP
2004
Springer
14 years 1 months ago
Learning a Hidden Subgraph
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
Noga Alon, Vera Asodi
JCO
1998
97views more  JCO 1998»
13 years 7 months ago
The Travelling Salesman Problem on Permuted Monge Matrices
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...
Rainer E. Burkard, Vladimir G. Deineko, Gerhard J....
EJC
2006
13 years 8 months ago
A note on Ramsey numbers with two parameters
1 The Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertices2 either G contains G1 or G contains G2, where G denotes the complement of G. In this...
Yi Ru Huang, Jian Sheng Yang, Kemin Zhang
DM
2010
129views more  DM 2010»
13 years 8 months ago
Interpolating between bounds on the independence number
For a non-negative integer T, we prove that the independence number of a graph G = (V, E) in which every vertex belongs to at most T triangles is at least uV f(d(u), T) where d(u)...
Anett Boßecker, Dieter Rautenbach