We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...
We present HyperGraphDB, a novel graph database based on generalized hypergraphs where hyperedges can contain other hyperedges. This generalization automatically reifies every ent...
Software metrics can be used to objectively quantify the quality of software components and systems, alleviating quality and risk concerns and raising assurance in component-based...
A fundamental concern of information integration in an XML context is the ability to embed one or more source documents in a target document so that (a) the target document confor...
Philip Bohannon, Wenfei Fan, Michael Flaster, P. P...