1664 search results - page 144 / 333 » Distance labeling in graphs |
143
click to vote
ENTCS
2008
15 years 4 months ago
2008
We describe a method for proving the termination of graph transformation systems. The method is based on the fact that infinite reductions must include infinite `creation chains&#...
103
click to vote
DCG
2000
15 years 4 months ago
2000
In this paper we consider the cocircuit graph GM of an oriented matroid M, the 1-skeleton of the cell complex W formed by the span of the cocircuits of M. In general, W is not dete...
139
Voted
EPIA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
137
click to vote
ESA
2004
Springer
15 years 10 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
174
click to vote
NIPS
2008
15 years 6 months ago
2008
Semantic hashing[1] seeks compact binary codes of data-points so that the Hamming distance between codewords correlates with semantic similarity. In this paper, we show that the p...