In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
Linguists often represent the relationships between words in a collection of text as an undirected graph G = (V, E), were V is the vocabulary and vertices are adjacent in G if and...
Pranav Anand, Henry Escuadro, Ralucca Gera, Craig ...
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
Ali Shokoufandeh, Yakov Keselman, M. Fatih Demirci...
Scientists, engineers, and educators commonly need to make graphs that quickly illustrate quantitative ideas yet are not based on specific data sets. We call these graphs quantita...