Sciweavers

3268 search results - page 183 / 654
» The hub number of a graph
Sort
View
JDA
2010
122views more  JDA 2010»
15 years 1 months ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
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...
Ignasi Sau, Dimitrios M. Thilikos
ICASSP
2011
IEEE
14 years 10 months ago
Factor graph switching portfolios under transaction costs
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...
Andrew J. Bean, Andrew C. Singer
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
Human Motion Synthesis with Optimization-based Graphs
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 ...
Cheng Ren, Liming Zhao, Alla Safonova
WAW
2009
Springer
136views Algorithms» more  WAW 2009»
16 years 1 months ago
Permuting Web Graphs
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...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
COCOON
2009
Springer
16 years 1 months ago
Convex Partitions with 2-Edge Connected Dual Graphs
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaqu...