3008 search results - page 141 / 602 » Independence in connected graphs |
191
click to vote
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
170
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
195
click to vote
MOBIHOC
2002
ACM
16 years 6 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...
172
click to vote
HT
2003
ACM
15 years 11 months ago
2003
ACM
Web sites today serve many different functions, such as corporate sites, search engines, e-stores, and so forth. As sites are created for different purposes, their structure and...
197
click to vote
INFOCOM
2006
IEEE
16 years 14 days ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...