Sciweavers

1983 search results - page 153 / 397
» Competitive graph searches
Sort
View
EVOW
2005
Springer
14 years 1 months ago
Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring
In this paper, we combine a powerful representation for graph colouring problems with different heuristic strategies for colour assignment. Our novel strategies employ heuristics ...
István Juhos, Attila Tóth, Jano I. v...
HUMAN
2003
Springer
14 years 1 months ago
A Graph-Based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks
Multipath on-demand routing protocols for mobile ad hoc networks try to reduce control overhead and end-to-end delay by computing multiple paths with a single route discovery proce...
Gunyoung Koh, Duyoung Oh, Heekyoung Woo
DASFAA
2010
IEEE
168views Database» more  DASFAA 2010»
13 years 9 months ago
A Large Scale Key-Value Store Based on Range-Key Skip Graph and Its Applications
An overlay network called Range-key Skip Graph (RKSG) has been proposed that can perform range-to-range search on peer-topeer network. In this paper, we propose a large scale key-v...
Susumu Takeuchi, Jun Shinomiya, Toru Shiraki, Yosh...
TCS
2008
13 years 8 months ago
Paths and trails in edge-colored graphs
This paper deals with the existence and search of properly edgecolored paths/trails between two, not necessarily distinct, vertices s and t in an edge-colored graph from an algori...
A. Abouelaoualim, Kinkar Chandra Das, L. Faria, Ya...
CN
2000
75views more  CN 2000»
13 years 7 months ago
Graph structure in the Web
The study of the web as a graph is not only fascinating in its own right, but also yields valuable insight into web algorithms for crawling, searching and community discovery, and...
Andrei Z. Broder, Ravi Kumar, Farzin Maghoul, Prab...