In the era of bigdata, we are deluged with massive graph data emerged from numerous social and scientific applications. In most cases, graph data are generated as lists of edges (edge list), where an edge denotes a link between a pair of entities. However, most of the graph algorithms work efficiently when information of the adjacent nodes (adjacency list) for each node are readily available. A...

Let G denote a geometric graph. In particular, V (G) is a set of points in general position in R and the edge uv ∈ E(G) is the straight line segment joining the corresponding pair of points. Two edges, say uv and xy, are said to cross if the interiors of the line segments from u to v and x to y have nonempty intersection. A bijection from V (G) to itself is called a geometric automorphism if it...

Graphs are popular data structures used to model pair wise relations between elements from a given collection. In image processing, adjacency graphs are often used to represent the relations between segmented regions. Such graphs can be compared but graph matching strategies are essential to find similar patterns. In this paper, we propose to detect the recurrent characters of a comics book. In...

We explore algebraic and spectral properties of weighted graphs containing twin vertices that are useful in quantum state transfer. extend the notion adjacency strong cospectrality to Hermitian matrices, with focus on generalized matrix normalized matrix. then determine necessary sufficient conditions such a pair graph exhibits respect above-mentioned matrices. also when is preserved under Cart...

We describe a new corpus of over 180,000 handannotated dialog act tags and accompanying adjacency pair annotations for roughly 72 hours of speech from 75 naturally-occurring meetings. We provide a brief summary of the annotation system and labeling procedure, inter-annotator reliability statistics, overall distributional statistics, a description of auxiliary files distributed with the corpus, ...