A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
We have proposed in the past three separate methodologies for secure software development. We have found that they have many common and complementary aspects and we proposed a com...
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
This paper describes three important pillars of publishing programs emerging at university libraries: providing a robust publishing platform, engaging the academic community in di...
Benchmarks provide an experimental basis for evaluating software engineering processes or techniques in an objective and repeatable manner. We present the FAULTBENCH v0.1 benchmar...