Sciweavers

3396 search results - page 255 / 680
» Tree representations of graphs
Sort
View
PLDI
2004
ACM
14 years 3 months ago
Cost effective dynamic program slicing
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
Xiangyu Zhang, Rajiv Gupta
AAAI
2007
13 years 12 months ago
Semantic Inference at the Lexical-Syntactic Level
Semantic inference is an important component in many natural language understanding applications. Classical approaches to semantic inference rely on complex logical representation...
Roy Bar-Haim, Ido Dagan, Iddo Greental, Eyal Shnar...
STACS
2007
Springer
14 years 3 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom
SCAM
2003
IEEE
14 years 2 months ago
The Java System Dependence Graph
The Program Dependence Graph was introduced by Ottenstein and Ottenstein in 1984. It was suggested to be a suitable internal program representation for monolithic programs, for th...
Neil Walkinshaw, Marc Roper, Murray Wood
OOPSLA
1999
Springer
14 years 1 months ago
The Generic Graph Component Library
In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Sta...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine