820 search results - page 79 / 164 » Inducing Temporal Graphs |
117
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
199
Voted
IWPEC
2010
Springer
15 years 15 days ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
121
Voted
KDD
2010
ACM
15 years 4 months ago
2010
ACM
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...
134
Voted
IPMI
2007
Springer
16 years 3 months ago
2007
Springer
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
226
click to vote
SIGMOD
2006
ACM
16 years 2 months ago
2006
ACM
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...