2314 search results - page 80 / 463 » Minimal Partitions of a Graph |
164
Voted
CORR
1999
Springer
15 years 3 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
123
Voted
ASPDAC
1999
ACM
15 years 7 months ago
1999
ACM
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
141
Voted
ICCAD
2003
IEEE
16 years 12 days ago
2003
IEEE
Abstract: In this paper, we present an interprocessor communication-aware task scheduling algorithm applicable to a multiprocessor system executing an application with dependent ta...
121
Voted
SBACPAD
2003
IEEE
15 years 8 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
158
Voted
SDM
2009
SIAM
16 years 21 days ago
2009
SIAM
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...