54 search results - page 1 / 11 » Forcing highly connected subgraphs |
JGT
2007
13 years 11 months ago
2007
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
DM
2008
13 years 11 months ago
2008
We consider the following question of Bollob
IROS
2008
IEEE
14 years 5 months ago
2008
IEEE
— A force control device with high power and high resolution is developed. It consists of a spring and a small force actuator which are connected in parallel between the base pla...
ISCC
2008
IEEE
14 years 5 months ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
EDBT
2012
ACM
12 years 1 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...