6740 search results - page 378 / 1348 » An s -Hamiltonian Line Graph Problem |
126
click to vote
IWOCA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
165
click to vote
ICPADS
1998
IEEE
15 years 9 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
146
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
153
click to vote
COR
2011
14 years 11 months ago
2011
The purpose of this paper is twofold. First, it explores the issue of producing valid, compact round-robin sports schedules by considering the problem as one of graph colouring. U...
131
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...