Sciweavers

MST
2010
106views more  MST 2010»
13 years 3 months ago
Constrained-Path Labellings on Graphs of Bounded Clique-Width
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
Bruno Courcelle, Andrew Twigg