4009 search results - page 453 / 802 » Clustering on Complex Graphs |
172
click to vote
ICPP
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper describes a novel compile-time list-based task scheduling algorithm for distributed-memory systems, called Fast Load Balancing (FLB). Compared to other typical list sch...
140
click to vote
ASPDAC
1995
ACM
15 years 10 months ago
1995
ACM
--In this paper, a region definition and ordering assignment (RDAOA) algorithm on minimizing the number of switchboxes is proposed. The time complexity of the algorithm is proved t...
144
click to vote
JETAI
2002
15 years 6 months ago
2002
Several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of wellknown algorithms are proposed. Algo...
209
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
180
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...