4171 search results - page 210 / 835 » Choice numbers of graphs |
179
click to vote
COMBINATORICS
2004
15 years 6 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...
165
click to vote
JDA
2010
15 years 1 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
165
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We consider the sequential portfolio investment problem. Building on results in signal processing, machine learning, and other areas, we use factor graphs to develop new universal...
164
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
2010
Eurographics
Continuous constrained optimization is a powerful tool for synthesizing novel human motion segments that are short. Graph-based motion synthesis methods such as motion graphs and ...
174
click to vote
WAW
2009
Springer
16 years 1 months ago
2009
Springer
Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usuall...