Sciweavers

3211 search results - page 83 / 643
» On the Grundy Number of a Graph
Sort
View
AMC
2005
145views more  AMC 2005»
13 years 9 months ago
Connectivity graphs as models of local interactions
In this paper, we study graphs that arise from certain sensory and communication limitations on the local interactions in multi-agent systems. In particular, we show that the set ...
Abubakr Muhammad, Magnus Egerstedt
ALGORITHMS
2010
114views more  ALGORITHMS 2010»
13 years 6 months ago
Graph Extremities Defined by Search Algorithms
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search a...
Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Ge...
TIP
2011
164views more  TIP 2011»
13 years 4 months ago
Multiregion Image Segmentation by Parametric Kernel Graph Cuts
Abstract—The purpose of this study is to investigate multiregion graph cut image partitioning via kernel mapping of the image data. The image data is transformed implicitly by a ...
Mohamed Ben Salah, Amar Mitiche, Ismail Ben Ayed
ICCV
2011
IEEE
12 years 9 months ago
Learning Spatiotemporal Graphs of Human Activities
Complex human activities occurring in videos can be defined in terms of temporal configurations of primitive actions. Prior work typically hand-picks the primitives, their total...
William Brendel, Sinisa Todorovic
DMGT
2011
94views more  DMGT 2011»
13 years 17 days ago
Closed k-stop distance in graphs
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...