3267 search results - page 66 / 654 » Generalized quasirandom graphs |
92
Voted
COCOON
2008
Springer
15 years 27 days ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
JCT
2011
14 years 2 months ago
2011
Abstract. Norton and Stein associated a number with each idempotent quasigroup or diagonalized Latin square of given finite order n, showing that it is congruent mod 2 to the tria...
LATIN
2004
Springer
15 years 4 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
102
click to vote
TCBB
2010
14 years 5 months ago
2010
Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve kno...
110
click to vote
SIGMOD
2011
ACM
14 years 1 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...