In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
The study of transportability aims to identify conditions under which causal information learned from experiments can be reused in a different environment where only passive obser...
An important part of the computer science is focused on the links that can be established between group theory and graph theory. Cayley graphs can establish such a link but meet so...
For many years, meeting satisfaction has been a key outcome variable in experimental Group Support Systems (GSS) research. GSS research results on meeting satisfaction are conflic...
Robert O. Briggs, Gert-Jan de Vreede, Bruce A. Rei...
Recently there has been a surge of interest in making computer science education attractive to potential students, motivating to current students, and relevant to graduating stude...
Lakshman Myneni, Margaret Ross, T. Dean Hendrix, N...