Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
Graphs are of growing importance in modeling complex structures such as chemical compounds, proteins, images, and program dependence. Given a query graph Q, the subgraph isomorphi...
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Abstract. The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G...
N. S. Narayanaswamy, Naveen Belkale, L. Sunil Chan...