4865 search results - page 583 / 973 » The Complexity of Graph Connectivity |
175
Voted
DAM
2006
15 years 6 months ago
2006
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
209
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
187
click to vote
WDAG
2010
Springer
15 years 5 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
197
click to vote
BIOCOMP
2010
15 years 3 months ago
2010
Abstract-- This study deals with investigating the classification performance of information-theoretic measures when applied to complex biological networks. In particular, our aim ...
233
click to vote
DISOPT
2011
14 years 10 months ago
2011
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...