Abstract--While directional adaption is introduced into traditional transforms, different orders of two 1-D transforms will result in different results of one 2-D transform. Based ...
Abstract. We show that the tree-width of a graph can be defined without reference to graph vertices, and hence the notion of tree-width can be naturally extended to matroids. (This...
Abstract. We analyze Roman domination from a parameterized perspective. More specifically, we prove that this problem is W[2]-complete for general graphs. However, parameterized al...
We describe a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation coll...
Abstract. A transformation F between protocols associates the messages sent and received by participants in a protocol Π1 with messages sent and received in some Π2. Transformati...