1963 search results - page 105 / 393 » The Maximum Solution Problem on Graphs |
178
click to vote
JGAA
2006
15 years 6 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
171
click to vote
FCS
2006
15 years 7 months ago
2006
: In the complete graph K2m+3 for m 2, we study some structures of simple non-isomorphic Hamiltonian sub-graphs of the form H ( 2m+3 , 6m+3) for m 2 . The various structures of t...
181
click to vote
IJCNN
2006
IEEE
16 years 12 days ago
2006
IEEE
Abstract— The incomplete information about the Web structure causes inaccurate results of various ranking algorithms. In this paper, we propose a solution to this problem by form...
173
click to vote
BIRTHDAY
2005
Springer
15 years 8 months ago
2005
Springer
Software engineers usually represent problems and solutions aph-based notations at different levels of abstractions. These notations are often semi-formal, but the use of graph tr...
158
click to vote
FOCI
2007
IEEE
16 years 21 days ago
2007
IEEE
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...