3008 search results - page 96 / 602 » Independence in connected graphs |
296
click to vote
SPAA
2012
ACM
13 years 8 months ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
175
click to vote
PODC
2005
ACM
15 years 12 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
171
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
111
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
This paper introduces parity versions of familiar graph theoretic results, in particular results related to 2-connectedness. The even and odd circuit connected graphs are characte...
223
click to vote
DAM
2011
15 years 1 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...