2487 search results - page 151 / 498 » Partitions of Graphs into Trees |
149
Voted
STACS
2001
Springer
15 years 8 months ago
2001
Springer
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
150
Voted
TALG
2008
15 years 3 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
139
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We present a methodology for enhancing the delivery of usergenerated content in online social networks. To this end, we first regularize the social graph via node capacity and li...
121
click to vote
EUROPAR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on stead...
134
Voted
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...