4865 search results - page 261 / 973 » The Complexity of Graph Connectivity |
154
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
223
click to vote
IPPS
2007
IEEE
16 years 28 days ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
148
click to vote
ENDM
2007
15 years 6 months ago
2007
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...
163
click to vote
IJCNN
2007
IEEE
16 years 28 days ago
2007
IEEE
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
203
click to vote
IPPS
2006
IEEE
16 years 19 days ago
2006
IEEE
The following three questions should be answered in developing new topology with more powerful ability to tolerate node-failure in wireless sensor network. First, what is node-fai...