1545 search results - page 202 / 309 » On tree congestion of graphs |
PLDI
1995
ACM
15 years 1 months ago
1995
ACM
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
IDA
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
110
click to vote
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
111
click to vote
IMCSIT
2010
14 years 8 months ago
2010
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...