4865 search results - page 303 / 973 » The Complexity of Graph Connectivity |
157
click to vote
GG
2008
Springer
15 years 7 months ago
2008
Springer
A variety of computation models have been developed using graphs and graph transformations. These include models for sequential, distributed, parallel or mobile computation. A grap...
166
click to vote
ISCC
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
180
click to vote
IAT
2006
IEEE
16 years 22 days ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
180
Voted
CIDM
2009
IEEE
15 years 10 months ago
2009
IEEE
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
182
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...