Sciweavers

2125 search results - page 232 / 425
» On Graph Complexity
Sort
View
99
Voted
CORR
2008
Springer
73views Education» more  CORR 2008»
15 years 3 months ago
On acceptance conditions for membrane systems: characterisations of L and NL
In this paper we investigate the affect of various acceptance conditions on recogniser membrane systems without dissolution. We demonstrate that two particular acceptance conditio...
Niall Murphy, Damien Woods
114
Voted
DAM
2006
81views more  DAM 2006»
15 years 3 months ago
The satisfactory partition problem
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...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
150
Voted
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
15 years 1 months ago
Computing Stable Outcomes in Hedonic Games
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...
Martin Gairing, Rahul Savani
WDAG
2010
Springer
183views Algorithms» more  WDAG 2010»
15 years 1 months ago
What Is the Use of Collision Detection (in Wireless Networks)?
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,...
Johannes Schneider, Roger Wattenhofer
148
Voted
BIOCOMP
2010
15 years 8 days ago
A Network-based Approach to Classify Disease Stages of Prostate Cancer Using Quantitative Network Measures
Abstract-- This study deals with investigating the classification performance of information-theoretic measures when applied to complex biological networks. In particular, our aim ...
Laurin A. J. Mueller, Karl G. Kugler, Andreas Dand...