5393 search results - page 150 / 1079 » Spatial Computing with Labels |
EDBT
2000
ACM
15 years 5 months ago
2000
ACM
126
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
129
click to vote
JAIR
2000
15 years 1 months ago
2000
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
143
click to vote
ESA
1998
Springer
15 years 6 months ago
1998
Springer
An ordered tree is a tree in which each node's incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The e...
114
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest...