5473 search results - page 88 / 1095 » On the graph isomorphism problem |
192
click to vote
JCO
2008
15 years 6 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
149
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
147
click to vote
AE
2007
Springer
16 years 15 days ago
2007
Springer
The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring proble...
171
click to vote
AAAI
2004
15 years 7 months ago
2004
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
153
click to vote
WG
1998
Springer
15 years 10 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....