284 search results - page 18 / 57 » Linear Time Algorithms for Generalized Edge Dominating Set P... |
126
click to vote
ISCAS
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
130
click to vote
DAM
2008
15 years 2 months ago
2008
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
125
click to vote
PODC
2005
ACM
15 years 8 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
122
click to vote
WG
2004
Springer
15 years 7 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
130
click to vote
COCO
2004
Springer
15 years 6 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...