180 search results - page 34 / 36 » Minimum congestion spanning trees in planar graphs |
ADHOC
2005
13 years 6 months ago
2005
In the minimum energy broadcasting problem, each node adjusts its transmission power to minimize the total energy consumption while still guaranteeing the full coverage of the net...
CIE
2007
Springer
14 years 10 days ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
ACID
2006
13 years 7 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
CVPR
2006
IEEE
14 years 8 months ago
2006
IEEE
We investigate the problem of learning the structure of an articulated object, i.e. its kinematic chain, from feature trajectories under affine projections. We demonstrate this po...
MOBIHOC
2002
ACM
14 years 5 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...