829 search results - page 75 / 166 » Distance domination-critical graphs |
170
click to vote
CJCDGCGT
2005
Springer
15 years 8 months ago
2005
Springer
The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V (G) can be partitioned so that each subset induces an acyclic subgraph. The f...
180
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
176
click to vote
FOCS
2006
IEEE
16 years 12 days ago
2006
IEEE
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
160
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
Abstract— ACG (Adjacent Constraint Graph) is a general floorplan representation. The refinement of constraint graphs gives not only an efficient representation but also a repre...
175
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...