760 search results - page 45 / 152 » Algorithms for finding clique-transversals of graphs |
114
click to vote
TCS
2008
15 years 1 months ago
2008
This paper deals with the existence and search of properly edgecolored paths/trails between two, not necessarily distinct, vertices s and t in an edge-colored graph from an algori...
139
click to vote
JCO
2006
15 years 1 months ago
2006
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
111
click to vote
STOC
1994
ACM
15 years 6 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
129
click to vote
IPPS
2010
IEEE
14 years 12 months ago
2010
IEEE
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
119
click to vote
SWAT
1994
Springer
15 years 6 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...