715 search results - page 81 / 143 » On graphs with subgraphs having large independence numbers |
121
click to vote
SPAA
2010
ACM
15 years 4 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
CN
2008
14 years 12 months ago
2008
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
AAAI
2006
15 years 1 months ago
2006
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
DSD
2006
IEEE
15 years 6 months ago
2006
IEEE
We propose a novel two-level Boolean minimizer coming in succession to our previously developed minimizer BOOM, so we have named it BOOM-II. It is a combination of two minimizers,...
111
click to vote
JISE
2000
14 years 11 months ago
2000
We present an algorithm for identifyinga set of faults that do not have to be targeted by a sequential delay fault test generator. These faults either cannot independently aect th...