3008 search results - page 351 / 602 » Independence in connected graphs |
160
click to vote
FOCS
1997
IEEE
15 years 11 months ago
1997
IEEE
The problem of maintaining data that arrives continuously over time is increasingly prevalent in databases and digital libraries. Building on a model for sliding-window indices de...
168
click to vote
FOCS
1996
IEEE
15 years 11 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
148
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
The paper investigates the synchronization of a network of identical linear state-space models under a possibly time-varying and directed interconnection structure. The main resul...
158
click to vote
CCCG
2010
15 years 8 months ago
2010
In this paper we consider a wireless network, where each transceiver is equipped with a directional antenna, and study two direction assignment problems, determined by the type of...
169
click to vote
MVA
1998
15 years 8 months ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...