Sciweavers

50 search results - page 6 / 10
» Finding the chromatic number by means of critical graphs
Sort
View
PRICAI
2004
Springer
14 years 1 days ago
The Happy Searcher: Challenges in Web Information Retrieval
Search has arguably become the dominant paradigm for finding information on the World Wide Web. In order to build a successful search engine, there are a number of challenges that ...
Mehran Sahami, Vibhu O. Mittal, Shumeet Baluja, He...
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
13 years 10 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
CEC
2009
IEEE
14 years 1 months ago
Symmetric networks foster to evolve desirable turn-taking rules in dispersion games
— Using a game-theoretic model combined with the evolutionary model, we investigate the conditions under which the desirable interaction rules will evolve and sustain in various ...
Akira Namatame, Hiroshi Sato
IJCM
2002
92views more  IJCM 2002»
13 years 6 months ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo
TAP
2008
Springer
102views Hardware» more  TAP 2008»
13 years 6 months ago
Visualizing graphs in three dimensions
It has been known for some time that larger graphs can be interpreted if laid out in 3D and displayed with stereo and/or motion depth cues to support spatial perception. However, ...
Colin Ware, Peter Mitchell