5606 search results - page 106 / 1122 » Randomization Techniques for Graphs. |
131
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
142
click to vote
COR
2011
14 years 10 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...
134
Voted
HCI
2009
15 years 1 months ago
2009
Circular anchored maps have been proposed as a drawing technique to acquire knowledge from bipartite graphs, where nodes in one set are arranged on a circumference. However, the re...
167
Voted
DFG
1992
Springer
15 years 7 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
144
Voted
ICMCS
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper, we use the three-dimensionaltopological shape information for human face identification. We propose a new method to represent 3D faces as a topological graph. Fine...