2503 search results - page 383 / 501 » A study of 3-arc graphs |
WCRE
1993
IEEE
14 years 2 months ago
1993
IEEE
Recognizing commonly used data structures and algorithms is a key activity in reverse engineering. Systems developed to automate this recognition process have been isolated, stand...
PODC
2010
ACM
14 years 2 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
EDOC
2009
IEEE
14 years 2 months ago
2009
IEEE
This paper studies the following problem: given a pair of business process models, determine which elements in one model are related to which elements in the other model. This prob...
ESOP
2009
Springer
14 years 2 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
HT
2007
ACM
14 years 2 months ago
2007
ACM
In this paper we present a visual education tool for efficient and effective learning. The toolkit is based on a simple premise: simple concepts should be learned before advanced ...