2612 search results - page 180 / 523 » Switching Graphs and Their Complexity |
162
click to vote
ICPADS
1998
IEEE
15 years 8 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...
153
click to vote
TAGT
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. Management of development processes in di erent engineering disciplines is a challenging task. We present an integrated approach which covers not only the activities to b...
127
click to vote
WG
1998
Springer
15 years 8 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
151
click to vote
PODC
2010
ACM
15 years 6 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
103
click to vote
DCG
2000
15 years 4 months ago
2000
In this paper we consider the cocircuit graph GM of an oriented matroid M, the 1-skeleton of the cell complex W formed by the span of the cocircuits of M. In general, W is not dete...