Sciweavers

1404 search results - page 66 / 281
» Optimization problems in multiple-interval graphs
Sort
View
EDBT
2009
ACM
241views Database» more  EDBT 2009»
15 years 4 months ago
GADDI: distance index based subgraph matching in biological networks
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...
Shijie Zhang, Shirong Li, Jiong Yang
SIAMCOMP
2010
97views more  SIAMCOMP 2010»
14 years 8 months ago
Designing Network Protocols for Good Equilibria
Designing and deploying a network protocol determines the rules by which end users interact with each other and with the network. We consider the problem of designing a protocol t...
Ho-Lin Chen, Tim Roughgarden, Gregory Valiant
CEC
2005
IEEE
14 years 11 months ago
Graph composition in a graph grammar-based method for automata network evolution
The dynamics of neural and other automata networks are defined to a large extent by their topologies. Artificial evolution constitutes a practical means by which an optimal topolog...
Martin H. Luerssen, David M. W. Powers
IWPEC
2009
Springer
15 years 4 months ago
Boolean-Width of Graphs
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
CASES
2009
ACM
15 years 4 months ago
Optimal loop parallelization for maximizing iteration-level parallelism
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
Duo Liu, Zili Shao, Meng Wang, Minyi Guo, Jingling...