1002 search results - page 32 / 201 » Towards Graph Programs for Graph Algorithms |
LCTRTS
2004
Springer
15 years 7 months ago
2004
Springer
While concurrency in embedded systems is most often supplied by real-time operating systems, this approach can be unpredictable and difficult to debug. Synchronous concurrency, i...
124
click to vote
CCS
2006
ACM
15 years 5 months ago
2006
ACM
Attack graphs are important tools for analyzing security vulnerabilities in enterprise networks. Previous work on attack graphs has not provided an account of the scalability of t...
116
click to vote
ORL
1998
15 years 1 months ago
1998
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
118
Voted
ESOP
2010
Springer
15 years 11 months ago
2010
Springer
Iterated Register Coalescing (IRC) is a widely used heuristic for performing register allocation via graph coloring. Many implementations in existing compilers follow (more or less...
115
click to vote
PKDD
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...