Sciweavers

1605 search results - page 136 / 321
» On Partitional Labelings of Graphs
Sort
View
DASFAA
2009
IEEE
173views Database» more  DASFAA 2009»
14 years 2 months ago
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu ...
CVPR
2007
IEEE
15 years 20 days ago
Graph Cut Based Optimization for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
Olga Veksler
DEXA
2004
Springer
106views Database» more  DEXA 2004»
14 years 4 months ago
A Graph-Based Data Model to Represent Transaction Time in Semistructured Data
Abstract. In this paper we propose the Graphical sEmistructured teMporal data model (GEM), which is based on labeled graphs and allows one to represent in a uniform way semistructu...
Carlo Combi, Barbara Oliboni, Elisa Quintarelli
SENSYS
2003
ACM
14 years 3 months ago
GEM: graph eMbedding for routing and data-centric storage in sensor networks without geographic information
The widespread deployment of sensor networks is on the horizon. One of the main challenges in sensor networks is to process and aggregate data in the network rather than wasting e...
James Newsome, Dawn Xiaodong Song
DM
2010
105views more  DM 2010»
13 years 10 months ago
On k-minimum and m-minimum edge-magic injections of graphs
An edge-magic total labelling (EMTL) of a graph G with n vertices and e edges is an injection : V (G)E(G) [n+e], where, for every edge uv E(G), we have wt(uv) = k, the magic sum...
John P. McSorley, John A. Trono