1002 search results - page 65 / 201 » Towards Graph Programs for Graph Algorithms |
111
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
165
click to vote
ANTSW
2004
Springer
15 years 6 months ago
2004
Springer
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
128
Voted
IEEEPACT
2002
IEEE
15 years 7 months ago
2002
IEEE
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...
131
click to vote
CCCG
2010
15 years 3 months ago
2010
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
148
Voted
SIGMOD
2011
ACM
14 years 5 months ago
2011
ACM
We consider extending decision support facilities toward large sophisticated networks, upon which multidimensional attributes are associated with network entities, thereby forming...