61 search results - page 8 / 13 » Parameterized Complexity of Even Odd Subgraph Problems |
ICCAD
2006
IEEE
14 years 5 months ago
2006
IEEE
Process variations in modern VLSI technologies are growing in both magnitude and dimensionality. To assess performance variability, complex simulation and performance models param...
PODC
2010
ACM
14 years 20 days ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
ALGORITHMICA
2008
13 years 9 months ago
2008
Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems. Somewhat surprisingly, not much work has so far been spent ...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
DNA
2006
Springer
14 years 14 days ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...