Sciweavers

2294 search results - page 240 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
AAAI
2004
15 years 4 months ago
A General Solution to the Graph History Interaction Problem
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 ...
Akihiro Kishimoto, Martin Müller 0003
COCOON
2009
Springer
15 years 9 months ago
Convex Recoloring Revisited: Complexity and Exact Algorithms
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
Iyad A. Kanj, Dieter Kratsch
115
Voted
STACS
2007
Springer
15 years 9 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom
EDBT
2006
ACM
174views Database» more  EDBT 2006»
16 years 3 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
GBRPR
2009
Springer
15 years 1 months ago
Electric Field Theory Motivated Graph Construction for Optimal Medical Image Segmentation
In this paper, we present a novel graph construction method and demonstrate its usage in a broad range of applications starting from a relatively simple single-surface segmentation...
Yin Yin, Qi Song, Milan Sonka