Sciweavers

990 search results - page 90 / 198
» Sub-Graphs of Complete Graph
Sort
View
MST
2006
99views more  MST 2006»
13 years 9 months ago
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
Tobias Riege, Jörg Rothe
WWW
2001
ACM
14 years 9 months ago
Finding Related Web Pages Based on Connectivity Information from a Search Engine
This paper proposes a method for finding related Web pages based on connectivity information of hyperlinks. As claimed by Kumar, a complete bipartite graph of Web pages can be reg...
Tsuyoshi Murata
ATAL
2005
Springer
14 years 2 months ago
Efficient information retrieval using mobile agents
We are concerned with the use of Mobile Agents for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve di...
Irene Sygkouna, Miltiades E. Anagnostou
ICALP
2004
Springer
14 years 2 months ago
Games with Winning Conditions of High Borel Complexity
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
Olivier Serre
AI
2010
Springer
13 years 9 months ago
AllDifferent-based filtering for subgraph isomorphism
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
Christine Solnon