Abstract-- We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to c...
Christopher L. Barrett, V. S. Anil Kumar, Madhav V...
— The aim of this paper is to provide a unified language for modeling both control software and physical plants in real time control systems. This is done by embedding the bond ...
Abstract. In this short communication, we survey the relationships between Cayley digraphs and their subgraphs and coset graphs with respect to subgroups and obtain some general re...
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...