Sciweavers

36781 search results - page 21 / 7357
» Parameterizing by the Number of Numbers
Sort
View
TAMC
2010
Springer
14 years 23 days ago
Incremental List Coloring of Graphs, Parameterized by Conservation
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
Sepp Hartung, Rolf Niedermeier
QOSA
2010
Springer
13 years 11 months ago
Parameterized Reliability Prediction for Component-Based Software Architectures
Critical properties of software systems, such as reliability, should be considered early in the development, when they can govern crucial architectural design decisions. A number o...
Franz Brosch, Heiko Koziolek, Barbora Buhnova, Ral...
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
14 years 6 days ago
On the Parameterized Complexity of Layered Graph Drawing
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
Vida Dujmovic, Michael R. Fellows, Michael T. Hall...
DATE
2004
IEEE
154views Hardware» more  DATE 2004»
13 years 11 months ago
Fast Exploration of Parameterized Bus Architecture for Communication-Centric SoC Design
For successful SoC design, efficient and scalable communication architecture is crucial. Some bus interconnects now provide configurable structures to meet this requirement of an ...
Chulho Shin, Young-Taek Kim, Eui-Young Chung, Kyu-...
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
13 years 5 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...