225 search results - page 13 / 45 » From polynomial time queries to graph structure theory |
KDD
2007
ACM
15 years 10 months ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
XSYM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We propose a mapping from the Enhanced Entity Relationship conceptual model to the W3C XML Schema Language with the following properties: information and integrity constr...
125
Voted
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
PVLDB
2008
14 years 9 months ago
2008
Reading and perceiving complex SQL queries has been a time consuming task in traditional database applications for decades. When it comes to decision support systems with automati...
SIAMDM
2010
14 years 4 months ago
2010
Inspired by the convex program of Eisenberg and Gale which captures Fisher markets with linear utilities, Jain and Vazirani [STOC, 2007] introduced the class of EisenbergGale (EG)...