4 search results - page 1 / 1 » Chordless Paths Through Three Vertices |
IWPEC
2004
Springer
13 years 10 months ago
2004
Springer
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
JCT
2006
13 years 4 months ago
2006
We consider the class A of graphs that contain no odd hole, no antihole, and no "prism" (a graph consisting of two disjoint triangles with three disjoint paths between th...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central ...
HCI
2009
13 years 2 months ago
2009
An ambient user interface is a set of hidden intelligent interfaces that recognize user's presence and provides services to immediate needs. There are several research activit...