We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitso...
- A representation for a set is defined to be symmetric if the space required for the representation of the set is the same as the space required for representation of the set'...
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...
Arunabha Sen, Sudheendra Murthy, Samrat Ganguly, S...