668 search results - page 19 / 134 » Algorithmics and Applications of Tree and Graph Searching |
136
click to vote
OPODIS
2008
15 years 5 months ago
2008
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
138
click to vote
EUROPAR
2004
Springer
15 years 9 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
143
click to vote
WSDM
2009
ACM
15 years 11 months ago
2009
ACM
This paper focuses on ‘user browsing graph’ which is constructed with users’ click-through behavior modeled with Web access logs. User browsing graph has recently been adopt...
142
click to vote
LCN
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—Distributed interactive applications may have stringent latency requirements and dynamic user groups. These applications may benefit from a group communication system, ...
149
click to vote
BPM
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...