3008 search results - page 149 / 602 » Independence in connected graphs |
228
Voted
ALGORITHMICA
2006
15 years 7 months ago
2006
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
167
click to vote
COMBINATORICS
2006
15 years 7 months ago
2006
A simple, undirected 2-connected graph G of order n belongs to class O(n,), 0, if 2 = n - . It is well known (Ore's theorem) that G is hamiltonian if = 0, in which case the 2...
168
click to vote
ISI
2007
Springer
16 years 1 months ago
2007
Springer
Graph data represents relationships, connections, or affinities. Innocent relationships produce repeated, and so common, substructures in graph data. We present techniques for dis...
189
click to vote
SPAA
2005
ACM
16 years 17 days ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
149
Voted
BIRTHDAY
2005
Springer
16 years 17 days ago
2005
Springer
Modularization is a well-known concept to structure software systems as well as their specifications. Modules are equipped with export and import interfaces and thus can be connec...