4865 search results - page 187 / 973 » The Complexity of Graph Connectivity |
110
click to vote
EJC
2010
15 years 3 months ago
2010
Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...
139
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
113
click to vote
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
— Network clustering enables us to view a complex network at the macro level, by grouping its nodes into units whose characteristics and interrelationships are easier to analyze ...
163
Voted
ICAS
2008
IEEE
15 years 10 months ago
2008
IEEE
—The purpose of this paper is to present the linkage of Thetis (a real time multi-vehicles hybrid simulator for heterogeneous vehicles) with a control architecture for the manage...
138
click to vote
ESCIENCE
2007
IEEE
15 years 10 months ago
2007
IEEE
As scientific workflows and the data they operate on, grow in size and complexity, the task of defining how those workflows should execute (which resources to use, where the resou...