3008 search results - page 448 / 602 » Independence in connected graphs |
167
click to vote
MST
2007
15 years 6 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
184
click to vote
IDA
2010
Springer
15 years 5 months ago
2010
Springer
According to Koestler, the notion of a bisociation denotes a connection between pieces of information from habitually separated domains or categories. In this paper, we consider a ...
208
click to vote
INCDM
2010
Springer
15 years 5 months ago
2010
Springer
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
220
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—Wireless sensor network (WSN) applications require redundant sensors to guarantee fault tolerance. However, the same degree of redundancy is not necessary for multi-hop communic...
185
click to vote
OOPSLA
2010
Springer
15 years 5 months ago
2010
Springer
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...