1357 search results - page 200 / 272 » Compositionality in Graph Transformation |
153
Voted
STACS
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...
168
click to vote
INFOVIS
2005
IEEE
15 years 9 months ago
2005
IEEE
We present a system that allows users to interactively explore complex flow scenarios represented as Sankey diagrams. Our system provides an overview of the flow graph and allows ...
152
click to vote
CCS
2003
ACM
15 years 9 months ago
2003
ACM
Understanding the strategies of attacks is crucial for security applications such as computer and network forensics, intrusion response, and prevention of future attacks. This pap...
149
Voted
NOMS
2002
IEEE
15 years 8 months ago
2002
IEEE
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
126
click to vote
ER
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...