4865 search results - page 371 / 973 » The Complexity of Graph Connectivity |
180
click to vote
VMV
2008
15 years 8 months ago
2008
In this paper we present a new surface reconstruction technique for piecewise smooth surfaces from point clouds, such as scans of architectural sites or man-made artifacts. The te...
182
click to vote
JCO
2007
15 years 6 months ago
2007
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G) is an m-tuple dominating set if S dominates every vertex of G at least m times, and an m-dominating...
211
click to vote
IFM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A communication system evolves dynamically with the addition and deletion of services. In our previous work [12], a graph transformation system (GTS) was used to model th...
198
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
295
click to vote
SIGMOD
2006
ACM
16 years 7 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...