6740 search results - page 69 / 1348 » An s -Hamiltonian Line Graph Problem |
126
click to vote
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
119
click to vote
DM
2002
15 years 3 months ago
2002
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
180
click to vote
CAV
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. The underground malware-based economy is flourishing and it is evident that the classical ad-hoc signature detection methods are becoming insufficient. Malware authors ...
114
click to vote
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
129
click to vote
WG
2004
Springer
15 years 8 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...