Sciweavers

656 search results - page 79 / 132
» Graph Theoretical Characterization and Computation of Answer...
Sort
View
BMCBI
2010
142views more  BMCBI 2010»
13 years 7 months ago
Discover Protein Complexes in Protein-Protein Interaction Networks Using Parametric Local Modularity
Background: Recent advances in proteomic technologies have enabled us to create detailed protein-protein interaction maps in multiple species and in both normal and diseased cells...
Jongkwang Kim, Kai Tan
WG
2007
Springer
14 years 1 months ago
Minimum-Weight Cycle Covers and Their Approximability
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey
CDC
2009
IEEE
161views Control Systems» more  CDC 2009»
14 years 13 days ago
Network structure preserving model reduction with weak a priori structural information
— This paper extends a state projection method for structure preserving model reduction to situations where only a weaker notion of system structure is available. This weaker not...
Enoch Yeung, Jorge M. Goncalves, Henrik Sandberg, ...
WG
2009
Springer
14 years 2 months ago
The Parameterized Complexity of Some Minimum Label Problems
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
Michael R. Fellows, Jiong Guo, Iyad A. Kanj
DAC
2002
ACM
14 years 8 months ago
Constraint-driven communication synthesis
Constraint-driven Communication Synthesis enables the automatic design of the communication architecture of a complex system from a library of pre-defined Intellectual Property (I...
Alessandro Pinto, Luca P. Carloni, Alberto L. Sang...