1986 search results - page 264 / 398 » Path Separability of Graphs |
156
Voted
DAGSTUHL
1996
15 years 4 months ago
1996
An analysis method for specialization of imperative programs is described in this paper. This analysis is an inter-procedural data flow method operating on control flow graphs and...
127
Voted
IS
2007
15 years 2 months ago
2007
Workflow management systems (WfMS) are widely used by business enterprises as tools for administrating, automating and scheduling the business process activities with the availab...
111
Voted
ARSCOM
1998
15 years 2 months ago
1998
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...
143
Voted
ML
2010
ACM
15 years 1 months ago
2010
ACM
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
117
Voted
DAM
2011
14 years 9 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...