3008 search results - page 81 / 602 » Independence in connected graphs |
98
Voted
ICC
2009
IEEE
14 years 10 months ago
2009
IEEE
This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connec...
112
click to vote
WEA
2005
Springer
15 years 6 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
MFCS
2004
Springer
15 years 6 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
74
Voted
BTW
2001
Springer
15 years 5 months ago
2001
Springer
In this article, we present our efforts1 on realizing transformation independence in open, extensible, and highly distributed multimedia information The main focus is on the abstra...
117
click to vote
SIAMDM
2010
14 years 7 months ago
2010
Let G be a graph with n vertices and independence number . Hadwiger's conjecture implies that G contains a clique minor of order at least n/. In 1982, Duchet and Meyniel prov...