1986 search results - page 188 / 398 » Path Separability of Graphs |
IJCAI
2007
13 years 11 months ago
2007
Effective representation of Web search results remains an open problem in the Information Retrieval community. For ambiguous queries, a traditional approach is to organize search ...
STACS
2009
Springer
14 years 5 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
ESAS
2006
Springer
14 years 1 months ago
2006
Springer
We derive the optimality results for key pre distribution scheme for distributed sensor networks, and relations between interesting parameters. Namely, given a key-pool of size n ...
NETWORK
2010
13 years 5 months ago
2010
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
IPPS
2007
IEEE
14 years 4 months 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...