715 search results - page 42 / 143 » On graphs with subgraphs having large independence numbers |
COMBINATORICS
2004
13 years 8 months ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
BMCBI
2006
13 years 8 months ago
2006
Background: The rapid growth of protein interactome data has elevated the necessity and importance of network analysis tools. However, unlike pure text data, network search spaces...
BMCBI
2004
13 years 8 months ago
2004
Background: One of the most time-consuming tasks after performing a gene expression experiment is the biological interpretation of the results by identifying physiologically impor...
CIKM
2011
Springer
12 years 8 months ago
2011
Springer
Large knowledge bases consisting of entities and relationships between them have become vital sources of information for many applications. Most of these knowledge bases adopt the...